/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/ludcmp.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:59:40,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:59:40,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:59:40,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:59:40,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:59:40,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:59:40,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:59:40,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:59:40,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:59:40,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:59:40,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:59:40,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:59:40,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:59:40,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:59:40,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:59:40,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:59:40,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:59:40,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:59:40,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:59:40,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:59:40,443 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:59:40,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:59:40,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:59:40,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:59:40,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:59:40,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:59:40,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:59:40,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:59:40,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:59:40,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:59:40,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:59:40,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:59:40,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:59:40,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:59:40,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:59:40,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:59:40,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:59:40,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:59:40,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:59:40,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:59:40,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:59:40,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:59:40,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 08:59:40,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:59:40,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:59:40,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:59:40,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:59:40,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:59:40,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:59:40,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:59:40,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:59:40,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:59:40,476 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:59:40,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:59:40,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:59:40,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:59:40,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:59:40,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:59:40,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:59:40,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:59:40,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:59:40,477 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:59:40,477 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:59:40,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:59:40,477 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 08:59:40,477 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:59:40,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:59:40,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:59:40,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:59:40,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:59:40,686 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:59:40,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/ludcmp.c [2022-04-08 08:59:40,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7876ae4/3bd3abde364143bea69bf006a383aae4/FLAG7976f670a [2022-04-08 08:59:41,071 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:59:41,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c [2022-04-08 08:59:41,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7876ae4/3bd3abde364143bea69bf006a383aae4/FLAG7976f670a [2022-04-08 08:59:41,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7876ae4/3bd3abde364143bea69bf006a383aae4 [2022-04-08 08:59:41,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:59:41,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:59:41,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:59:41,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:59:41,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:59:41,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:59:41" (1/1) ... [2022-04-08 08:59:41,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601313ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:41, skipping insertion in model container [2022-04-08 08:59:41,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:59:41" (1/1) ... [2022-04-08 08:59:41,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:59:41,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:59:41,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c[318,331] [2022-04-08 08:59:41,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:59:41,750 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:59:41,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c[318,331] [2022-04-08 08:59:41,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:59:41,790 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:59:41,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:41 WrapperNode [2022-04-08 08:59:41,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:59:41,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:59:41,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:59:41,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:59:41,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:41" (1/1) ... [2022-04-08 08:59:41,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:41" (1/1) ... [2022-04-08 08:59:41,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:41" (1/1) ... [2022-04-08 08:59:41,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:41" (1/1) ... [2022-04-08 08:59:41,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:41" (1/1) ... [2022-04-08 08:59:41,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:41" (1/1) ... [2022-04-08 08:59:41,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:41" (1/1) ... [2022-04-08 08:59:41,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:59:41,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:59:41,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:59:41,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:59:41,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:41" (1/1) ... [2022-04-08 08:59:41,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:59:41,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:41,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:59:41,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:59:41,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:59:41,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:59:41,931 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:59:41,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 08:59:41,931 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2022-04-08 08:59:41,931 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:59:41,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2022-04-08 08:59:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:59:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:59:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:59:42,030 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:59:42,031 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:59:42,574 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:59:42,579 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:59:42,579 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-04-08 08:59:42,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:59:42 BoogieIcfgContainer [2022-04-08 08:59:42,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:59:42,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:59:42,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:59:42,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:59:42,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:59:41" (1/3) ... [2022-04-08 08:59:42,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7462429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:59:42, skipping insertion in model container [2022-04-08 08:59:42,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:41" (2/3) ... [2022-04-08 08:59:42,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7462429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:59:42, skipping insertion in model container [2022-04-08 08:59:42,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:59:42" (3/3) ... [2022-04-08 08:59:42,587 INFO L111 eAbstractionObserver]: Analyzing ICFG ludcmp.c [2022-04-08 08:59:42,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:59:42,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:59:42,631 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:59:42,637 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:59:42,637 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:59:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 08:59:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 08:59:42,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:42,656 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:42,656 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:42,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1448102218, now seen corresponding path program 1 times [2022-04-08 08:59:42,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:42,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2008280351] [2022-04-08 08:59:42,671 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:59:42,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1448102218, now seen corresponding path program 2 times [2022-04-08 08:59:42,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:42,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538574127] [2022-04-08 08:59:42,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:42,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:42,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:42,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {67#true} is VALID [2022-04-08 08:59:42,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-08 08:59:42,844 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-08 08:59:42,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {67#true} call ULTIMATE.init(); {72#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:42,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {67#true} is VALID [2022-04-08 08:59:42,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-08 08:59:42,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-08 08:59:42,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret37 := main(); {67#true} is VALID [2022-04-08 08:59:42,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {67#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {67#true} is VALID [2022-04-08 08:59:42,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {67#true} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {67#true} is VALID [2022-04-08 08:59:42,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} assume !true; {68#false} is VALID [2022-04-08 08:59:42,848 INFO L272 TraceCheckUtils]: 8: Hoare triple {68#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {68#false} is VALID [2022-04-08 08:59:42,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} ~cond := #in~cond; {68#false} is VALID [2022-04-08 08:59:42,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#false} assume 0 == ~cond; {68#false} is VALID [2022-04-08 08:59:42,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-04-08 08:59:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:42,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:42,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538574127] [2022-04-08 08:59:42,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538574127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:42,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:42,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 08:59:42,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:42,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2008280351] [2022-04-08 08:59:42,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2008280351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:42,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:42,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 08:59:42,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808815474] [2022-04-08 08:59:42,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:42,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 08:59:42,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:42,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:42,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:42,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 08:59:42,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:42,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 08:59:42,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 08:59:42,891 INFO L87 Difference]: Start difference. First operand has 64 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:43,313 INFO L93 Difference]: Finished difference Result 147 states and 225 transitions. [2022-04-08 08:59:43,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 08:59:43,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 08:59:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-08 08:59:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-08 08:59:43,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2022-04-08 08:59:43,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:43,518 INFO L225 Difference]: With dead ends: 147 [2022-04-08 08:59:43,519 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 08:59:43,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 08:59:43,523 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:43,524 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 73 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 08:59:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-04-08 08:59:43,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:43,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:43,542 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:43,543 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:43,545 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 08:59:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 08:59:43,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:43,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:43,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-08 08:59:43,546 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-08 08:59:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:43,547 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 08:59:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 08:59:43,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:43,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:43,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:43,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-08 08:59:43,549 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-08 08:59:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:43,550 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-08 08:59:43,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-08 08:59:43,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-08 08:59:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 08:59:43,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:43,568 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:43,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:59:43,568 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:43,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:43,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1436096445, now seen corresponding path program 1 times [2022-04-08 08:59:43,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:43,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461449644] [2022-04-08 08:59:43,570 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:59:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1436096445, now seen corresponding path program 2 times [2022-04-08 08:59:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:43,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956977619] [2022-04-08 08:59:43,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:43,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:43,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:43,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {464#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {457#true} is VALID [2022-04-08 08:59:43,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-08 08:59:43,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} #214#return; {457#true} is VALID [2022-04-08 08:59:43,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {464#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:43,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {457#true} is VALID [2022-04-08 08:59:43,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-08 08:59:43,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #214#return; {457#true} is VALID [2022-04-08 08:59:43,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret37 := main(); {457#true} is VALID [2022-04-08 08:59:43,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {462#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-08 08:59:43,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {463#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:43,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {458#false} is VALID [2022-04-08 08:59:43,674 INFO L272 TraceCheckUtils]: 8: Hoare triple {458#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {458#false} is VALID [2022-04-08 08:59:43,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-08 08:59:43,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-08 08:59:43,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-08 08:59:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:43,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:43,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956977619] [2022-04-08 08:59:43,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956977619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:43,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:43,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:43,676 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:43,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461449644] [2022-04-08 08:59:43,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461449644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:43,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:43,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215142463] [2022-04-08 08:59:43,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:43,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 08:59:43,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:43,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:43,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:59:43,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:43,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:59:43,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:59:43,687 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:43,826 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-08 08:59:43,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:59:43,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 08:59:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-08 08:59:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-08 08:59:43,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-08 08:59:43,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:43,865 INFO L225 Difference]: With dead ends: 40 [2022-04-08 08:59:43,866 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 08:59:43,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:59:43,867 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:43,867 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 25 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:59:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 08:59:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-08 08:59:43,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:43,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:43,882 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:43,883 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:43,884 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 08:59:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 08:59:43,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:43,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:43,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-08 08:59:43,884 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-08 08:59:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:43,885 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 08:59:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 08:59:43,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:43,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:43,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:43,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-08 08:59:43,887 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-08 08:59:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:43,887 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-08 08:59:43,887 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:43,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-08 08:59:43,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-08 08:59:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 08:59:43,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:43,906 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:43,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:59:43,906 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:43,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1858105272, now seen corresponding path program 1 times [2022-04-08 08:59:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:43,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1670079150] [2022-04-08 08:59:43,915 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:43,915 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1858105272, now seen corresponding path program 2 times [2022-04-08 08:59:43,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:43,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281983231] [2022-04-08 08:59:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:43,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:43,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:43,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {653#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {645#true} is VALID [2022-04-08 08:59:43,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-08 08:59:43,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-08 08:59:43,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {653#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:43,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {645#true} is VALID [2022-04-08 08:59:43,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-08 08:59:43,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-08 08:59:43,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-08 08:59:43,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {645#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {650#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-08 08:59:43,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:43,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:43,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:43,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:43,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {652#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:43,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {652#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {646#false} is VALID [2022-04-08 08:59:43,998 INFO L272 TraceCheckUtils]: 12: Hoare triple {646#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {646#false} is VALID [2022-04-08 08:59:43,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2022-04-08 08:59:43,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#false} assume 0 == ~cond; {646#false} is VALID [2022-04-08 08:59:43,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-08 08:59:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:44,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:44,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281983231] [2022-04-08 08:59:44,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281983231] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:44,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755736117] [2022-04-08 08:59:44,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:44,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:44,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:44,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:44,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 08:59:44,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:44,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:44,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 08:59:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:44,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:44,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {645#true} is VALID [2022-04-08 08:59:44,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {645#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {645#true} is VALID [2022-04-08 08:59:44,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-08 08:59:44,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-08 08:59:44,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-08 08:59:44,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {645#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {672#(<= 5 main_~n~0)} is VALID [2022-04-08 08:59:44,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {672#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:44,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:44,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:44,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:44,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {689#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:44,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {689#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 <= ~n~0); {646#false} is VALID [2022-04-08 08:59:44,214 INFO L272 TraceCheckUtils]: 12: Hoare triple {646#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {646#false} is VALID [2022-04-08 08:59:44,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2022-04-08 08:59:44,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#false} assume 0 == ~cond; {646#false} is VALID [2022-04-08 08:59:44,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-08 08:59:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:44,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:44,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-08 08:59:44,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#false} assume 0 == ~cond; {646#false} is VALID [2022-04-08 08:59:44,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2022-04-08 08:59:44,320 INFO L272 TraceCheckUtils]: 12: Hoare triple {646#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {646#false} is VALID [2022-04-08 08:59:44,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {646#false} is VALID [2022-04-08 08:59:44,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {721#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {717#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 08:59:44,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {721#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {721#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:44,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {721#(<= (+ main_~j~0 1) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {721#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:44,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {721#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {721#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:44,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {734#(<= 1 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {721#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:44,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {645#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {734#(<= 1 main_~n~0)} is VALID [2022-04-08 08:59:44,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-08 08:59:44,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-08 08:59:44,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-08 08:59:44,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {645#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {645#true} is VALID [2022-04-08 08:59:44,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {645#true} is VALID [2022-04-08 08:59:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:44,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755736117] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:44,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:44,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-08 08:59:44,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:44,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1670079150] [2022-04-08 08:59:44,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1670079150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:44,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:44,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:59:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486242231] [2022-04-08 08:59:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:44,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 08:59:44,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:44,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:44,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:44,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:59:44,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:44,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:59:44,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:59:44,338 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:44,458 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-04-08 08:59:44,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:59:44,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 08:59:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-08 08:59:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-08 08:59:44,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-08 08:59:44,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:44,496 INFO L225 Difference]: With dead ends: 45 [2022-04-08 08:59:44,496 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 08:59:44,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:59:44,497 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:44,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 31 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:59:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 08:59:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-04-08 08:59:44,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:44,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:44,504 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:44,504 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:44,505 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-08 08:59:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-08 08:59:44,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:44,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:44,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-08 08:59:44,506 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-08 08:59:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:44,507 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-08 08:59:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-08 08:59:44,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:44,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:44,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:44,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 08:59:44,508 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-04-08 08:59:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:44,508 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 08:59:44,508 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:44,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 08:59:44,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 08:59:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:59:44,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:44,531 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:44,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:44,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:44,746 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:44,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1949651507, now seen corresponding path program 3 times [2022-04-08 08:59:44,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:44,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1288500996] [2022-04-08 08:59:44,787 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:44,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:44,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1949651507, now seen corresponding path program 4 times [2022-04-08 08:59:44,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:44,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208220685] [2022-04-08 08:59:44,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:44,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:44,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {967#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {959#true} is VALID [2022-04-08 08:59:44,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-08 08:59:44,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-08 08:59:44,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {967#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:44,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {967#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {959#true} is VALID [2022-04-08 08:59:44,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-08 08:59:44,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-08 08:59:44,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret37 := main(); {959#true} is VALID [2022-04-08 08:59:44,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {959#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {964#(= main_~i~0 0)} is VALID [2022-04-08 08:59:44,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {964#(= main_~i~0 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {965#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:44,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {965#(and (= main_~j~0 0) (= main_~i~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {965#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:44,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {965#(and (= main_~j~0 0) (= main_~i~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {965#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:44,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {965#(and (= main_~j~0 0) (= main_~i~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {965#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:44,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {965#(and (= main_~j~0 0) (= main_~i~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {966#(and (<= 1 main_~j~0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:44,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {966#(and (<= 1 main_~j~0) (= main_~i~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {966#(and (<= 1 main_~j~0) (= main_~i~0 0))} is VALID [2022-04-08 08:59:44,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {966#(and (<= 1 main_~j~0) (= main_~i~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {960#false} is VALID [2022-04-08 08:59:44,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {960#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {960#false} is VALID [2022-04-08 08:59:44,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {960#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {960#false} is VALID [2022-04-08 08:59:44,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {960#false} assume !(~j~0 <= ~n~0); {960#false} is VALID [2022-04-08 08:59:44,871 INFO L272 TraceCheckUtils]: 16: Hoare triple {960#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {960#false} is VALID [2022-04-08 08:59:44,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#false} ~cond := #in~cond; {960#false} is VALID [2022-04-08 08:59:44,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#false} assume 0 == ~cond; {960#false} is VALID [2022-04-08 08:59:44,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#false} assume !false; {960#false} is VALID [2022-04-08 08:59:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:44,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208220685] [2022-04-08 08:59:44,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208220685] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:44,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313451026] [2022-04-08 08:59:44,872 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:59:44,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:44,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:44,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:44,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 08:59:44,940 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:59:44,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:44,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 08:59:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:44,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:45,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2022-04-08 08:59:45,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {959#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {959#true} is VALID [2022-04-08 08:59:45,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-08 08:59:45,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-08 08:59:45,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret37 := main(); {959#true} is VALID [2022-04-08 08:59:45,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {959#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {986#(<= 5 main_~n~0)} is VALID [2022-04-08 08:59:45,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {986#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:45,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:45,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:45,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:45,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:45,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:45,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:45,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:45,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1016#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:45,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {1016#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 <= ~n~0); {960#false} is VALID [2022-04-08 08:59:45,146 INFO L272 TraceCheckUtils]: 16: Hoare triple {960#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {960#false} is VALID [2022-04-08 08:59:45,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#false} ~cond := #in~cond; {960#false} is VALID [2022-04-08 08:59:45,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#false} assume 0 == ~cond; {960#false} is VALID [2022-04-08 08:59:45,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#false} assume !false; {960#false} is VALID [2022-04-08 08:59:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:45,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:45,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#false} assume !false; {960#false} is VALID [2022-04-08 08:59:45,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#false} assume 0 == ~cond; {960#false} is VALID [2022-04-08 08:59:45,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#false} ~cond := #in~cond; {960#false} is VALID [2022-04-08 08:59:45,261 INFO L272 TraceCheckUtils]: 16: Hoare triple {960#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {960#false} is VALID [2022-04-08 08:59:45,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {1044#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {960#false} is VALID [2022-04-08 08:59:45,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1044#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 08:59:45,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1048#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:45,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {1048#(<= (+ main_~j~0 1) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1048#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:45,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1048#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:45,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {1061#(<= (+ main_~j~0 2) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1048#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:45,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(<= (+ main_~j~0 2) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1061#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:45,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#(<= (+ main_~j~0 2) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1061#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:45,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1061#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:45,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {1074#(<= 2 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1061#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:45,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {959#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1074#(<= 2 main_~n~0)} is VALID [2022-04-08 08:59:45,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret37 := main(); {959#true} is VALID [2022-04-08 08:59:45,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-08 08:59:45,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-08 08:59:45,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {959#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {959#true} is VALID [2022-04-08 08:59:45,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2022-04-08 08:59:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:45,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313451026] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:45,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:45,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-04-08 08:59:45,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:45,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1288500996] [2022-04-08 08:59:45,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1288500996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:45,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:45,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:59:45,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208993595] [2022-04-08 08:59:45,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:45,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:59:45,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:45,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:45,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:45,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:59:45,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:45,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:59:45,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:59:45,283 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:45,426 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 08:59:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:59:45,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:59:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-08 08:59:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-08 08:59:45,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-08 08:59:45,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:45,468 INFO L225 Difference]: With dead ends: 57 [2022-04-08 08:59:45,469 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 08:59:45,469 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-04-08 08:59:45,469 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:45,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:59:45,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 08:59:45,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-04-08 08:59:45,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:45,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:45,484 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:45,484 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:45,485 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-08 08:59:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-08 08:59:45,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:45,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:45,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-04-08 08:59:45,486 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-04-08 08:59:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:45,487 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-08 08:59:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-08 08:59:45,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:45,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:45,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:45,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-08 08:59:45,488 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2022-04-08 08:59:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:45,488 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-08 08:59:45,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:45,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-08 08:59:45,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 08:59:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:59:45,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:45,519 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:45,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:45,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 08:59:45,736 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:45,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1140304881, now seen corresponding path program 1 times [2022-04-08 08:59:45,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:45,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [495963289] [2022-04-08 08:59:45,744 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:45,744 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1140304881, now seen corresponding path program 2 times [2022-04-08 08:59:45,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:45,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093243620] [2022-04-08 08:59:45,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:45,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:45,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:45,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {1368#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1359#true} is VALID [2022-04-08 08:59:45,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-08 08:59:45,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-08 08:59:45,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1368#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:45,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {1368#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1359#true} is VALID [2022-04-08 08:59:45,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-08 08:59:45,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-08 08:59:45,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret37 := main(); {1359#true} is VALID [2022-04-08 08:59:45,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {1359#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1364#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-08 08:59:45,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {1364#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:45,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:45,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:45,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:45,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:45,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:45,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:45,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:45,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1367#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:45,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {1367#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {1360#false} is VALID [2022-04-08 08:59:45,833 INFO L272 TraceCheckUtils]: 16: Hoare triple {1360#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1360#false} is VALID [2022-04-08 08:59:45,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2022-04-08 08:59:45,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2022-04-08 08:59:45,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-04-08 08:59:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:45,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:45,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093243620] [2022-04-08 08:59:45,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093243620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:45,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439180559] [2022-04-08 08:59:45,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:45,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:45,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:45,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:45,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 08:59:45,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:45,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:45,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 08:59:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:45,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:46,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1359#true} is VALID [2022-04-08 08:59:46,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {1359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1359#true} is VALID [2022-04-08 08:59:46,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-08 08:59:46,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-08 08:59:46,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret37 := main(); {1359#true} is VALID [2022-04-08 08:59:46,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {1359#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1387#(<= 5 main_~n~0)} is VALID [2022-04-08 08:59:46,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {1387#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:46,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:46,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:46,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:46,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:46,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:46,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~i~0 == ~j~0); {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:46,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:46,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1417#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:46,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {1417#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 <= ~n~0); {1360#false} is VALID [2022-04-08 08:59:46,023 INFO L272 TraceCheckUtils]: 16: Hoare triple {1360#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1360#false} is VALID [2022-04-08 08:59:46,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2022-04-08 08:59:46,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2022-04-08 08:59:46,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-04-08 08:59:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:46,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:46,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-04-08 08:59:46,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2022-04-08 08:59:46,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2022-04-08 08:59:46,125 INFO L272 TraceCheckUtils]: 16: Hoare triple {1360#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1360#false} is VALID [2022-04-08 08:59:46,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {1445#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {1360#false} is VALID [2022-04-08 08:59:46,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {1449#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1445#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 08:59:46,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {1449#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1449#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:46,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {1449#(<= (+ main_~j~0 1) main_~n~0)} assume !(~i~0 == ~j~0); {1449#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:46,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {1449#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1449#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:46,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {1462#(<= (+ main_~j~0 2) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1449#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:46,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {1462#(<= (+ main_~j~0 2) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1462#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:46,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {1462#(<= (+ main_~j~0 2) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1462#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:46,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {1462#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1462#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:46,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {1475#(<= 2 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1462#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:46,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {1359#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1475#(<= 2 main_~n~0)} is VALID [2022-04-08 08:59:46,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret37 := main(); {1359#true} is VALID [2022-04-08 08:59:46,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-08 08:59:46,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-08 08:59:46,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {1359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1359#true} is VALID [2022-04-08 08:59:46,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1359#true} is VALID [2022-04-08 08:59:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:46,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439180559] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:46,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:46,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-04-08 08:59:46,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:46,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [495963289] [2022-04-08 08:59:46,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [495963289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:46,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:46,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:59:46,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603090590] [2022-04-08 08:59:46,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:46,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:59:46,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:46,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:46,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:46,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:59:46,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:46,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:59:46,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2022-04-08 08:59:46,148 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:46,308 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-04-08 08:59:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 08:59:46,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:59:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-08 08:59:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-08 08:59:46,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-08 08:59:46,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:46,348 INFO L225 Difference]: With dead ends: 68 [2022-04-08 08:59:46,348 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 08:59:46,348 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2022-04-08 08:59:46,349 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:46,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 32 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:59:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 08:59:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-04-08 08:59:46,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:46,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:46,372 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:46,372 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:46,373 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-08 08:59:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-08 08:59:46,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:46,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:46,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 49 states. [2022-04-08 08:59:46,373 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 49 states. [2022-04-08 08:59:46,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:46,374 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-08 08:59:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-08 08:59:46,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:46,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:46,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:46,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-08 08:59:46,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2022-04-08 08:59:46,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:46,376 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-08 08:59:46,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:46,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-08 08:59:46,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 08:59:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:59:46,415 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:46,416 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:46,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:46,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:46,632 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash -162258006, now seen corresponding path program 3 times [2022-04-08 08:59:46,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:46,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1300102236] [2022-04-08 08:59:46,650 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:46,650 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash -162258006, now seen corresponding path program 4 times [2022-04-08 08:59:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:46,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110718508] [2022-04-08 08:59:46,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:46,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:46,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:46,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {1830#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1820#true} is VALID [2022-04-08 08:59:46,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-08 08:59:46,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-08 08:59:46,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {1820#true} call ULTIMATE.init(); {1830#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:46,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {1830#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1820#true} is VALID [2022-04-08 08:59:46,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-08 08:59:46,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-08 08:59:46,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret37 := main(); {1820#true} is VALID [2022-04-08 08:59:46,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {1820#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1825#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-08 08:59:46,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {1825#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:46,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:46,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:46,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:46,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:46,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:46,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:46,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:46,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:46,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:46,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:46,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:46,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1829#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:46,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {1829#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} assume !(~j~0 <= ~n~0); {1821#false} is VALID [2022-04-08 08:59:46,734 INFO L272 TraceCheckUtils]: 20: Hoare triple {1821#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1821#false} is VALID [2022-04-08 08:59:46,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-04-08 08:59:46,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {1821#false} assume 0 == ~cond; {1821#false} is VALID [2022-04-08 08:59:46,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-04-08 08:59:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:46,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:46,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110718508] [2022-04-08 08:59:46,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110718508] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:46,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249097840] [2022-04-08 08:59:46,735 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:59:46,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:46,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:46,735 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:46,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 08:59:46,807 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:59:46,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:46,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 08:59:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:46,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:47,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {1820#true} call ULTIMATE.init(); {1820#true} is VALID [2022-04-08 08:59:47,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {1820#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1820#true} is VALID [2022-04-08 08:59:47,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-08 08:59:47,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-08 08:59:47,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret37 := main(); {1820#true} is VALID [2022-04-08 08:59:47,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {1820#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1849#(<= 5 main_~n~0)} is VALID [2022-04-08 08:59:47,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {1849#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:47,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:47,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:47,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:47,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:47,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:47,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~i~0 == ~j~0); {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:47,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:47,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:47,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:47,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !(~i~0 == ~j~0); {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:47,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:47,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1892#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:47,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {1892#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !(~j~0 <= ~n~0); {1821#false} is VALID [2022-04-08 08:59:47,020 INFO L272 TraceCheckUtils]: 20: Hoare triple {1821#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1821#false} is VALID [2022-04-08 08:59:47,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-04-08 08:59:47,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {1821#false} assume 0 == ~cond; {1821#false} is VALID [2022-04-08 08:59:47,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-04-08 08:59:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:47,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:47,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-04-08 08:59:47,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {1821#false} assume 0 == ~cond; {1821#false} is VALID [2022-04-08 08:59:47,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-04-08 08:59:47,150 INFO L272 TraceCheckUtils]: 20: Hoare triple {1821#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1821#false} is VALID [2022-04-08 08:59:47,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {1920#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {1821#false} is VALID [2022-04-08 08:59:47,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {1924#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1920#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 08:59:47,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {1924#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1924#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:47,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {1924#(<= (+ main_~j~0 1) main_~n~0)} assume !(~i~0 == ~j~0); {1924#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:47,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {1924#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1924#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:47,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {1937#(<= (+ main_~j~0 2) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1924#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:47,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {1937#(<= (+ main_~j~0 2) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1937#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:47,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {1937#(<= (+ main_~j~0 2) main_~n~0)} assume !(~i~0 == ~j~0); {1937#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:47,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {1937#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1937#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:47,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {1950#(<= (+ main_~j~0 3) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1937#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:47,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {1950#(<= (+ main_~j~0 3) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1950#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-08 08:59:47,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {1950#(<= (+ main_~j~0 3) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1950#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-08 08:59:47,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {1950#(<= (+ main_~j~0 3) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1950#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-08 08:59:47,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {1963#(<= 3 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1950#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-08 08:59:47,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {1820#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1963#(<= 3 main_~n~0)} is VALID [2022-04-08 08:59:47,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret37 := main(); {1820#true} is VALID [2022-04-08 08:59:47,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-08 08:59:47,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-08 08:59:47,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {1820#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1820#true} is VALID [2022-04-08 08:59:47,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {1820#true} call ULTIMATE.init(); {1820#true} is VALID [2022-04-08 08:59:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:47,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249097840] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:47,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:47,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-08 08:59:47,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:47,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1300102236] [2022-04-08 08:59:47,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1300102236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:47,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:47,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:59:47,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360528073] [2022-04-08 08:59:47,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:47,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:59:47,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:47,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:47,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:47,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:59:47,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:47,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:59:47,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-04-08 08:59:47,172 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:47,411 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-08 08:59:47,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 08:59:47,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:59:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-08 08:59:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-08 08:59:47,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-04-08 08:59:47,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:47,467 INFO L225 Difference]: With dead ends: 80 [2022-04-08 08:59:47,467 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 08:59:47,468 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2022-04-08 08:59:47,468 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:47,469 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 33 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:47,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 08:59:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-04-08 08:59:47,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:47,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:47,498 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:47,498 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:47,500 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-08 08:59:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-08 08:59:47,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:47,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:47,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-04-08 08:59:47,500 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-04-08 08:59:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:47,501 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-08 08:59:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-08 08:59:47,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:47,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:47,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:47,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-04-08 08:59:47,503 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 24 [2022-04-08 08:59:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:47,503 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-04-08 08:59:47,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:47,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 57 transitions. [2022-04-08 08:59:47,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-04-08 08:59:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:59:47,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:47,546 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:47,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:47,781 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:47,781 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:47,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:47,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1312024861, now seen corresponding path program 5 times [2022-04-08 08:59:47,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:47,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [403835213] [2022-04-08 08:59:47,786 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:47,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1312024861, now seen corresponding path program 6 times [2022-04-08 08:59:47,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:47,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265890561] [2022-04-08 08:59:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:47,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:47,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:47,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {2375#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2364#true} is VALID [2022-04-08 08:59:47,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-08 08:59:47,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-08 08:59:47,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2375#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:47,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {2375#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2364#true} is VALID [2022-04-08 08:59:47,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-08 08:59:47,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-08 08:59:47,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret37 := main(); {2364#true} is VALID [2022-04-08 08:59:47,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {2369#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-08 08:59:47,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {2369#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:47,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:47,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} assume !(~i~0 == ~j~0); {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:47,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:47,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2374#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:47,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {2374#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {2365#false} is VALID [2022-04-08 08:59:47,877 INFO L272 TraceCheckUtils]: 24: Hoare triple {2365#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {2365#false} is VALID [2022-04-08 08:59:47,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-08 08:59:47,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-08 08:59:47,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-08 08:59:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:47,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:47,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265890561] [2022-04-08 08:59:47,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265890561] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:47,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596007199] [2022-04-08 08:59:47,878 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:59:47,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:47,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:47,895 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:47,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 08:59:47,960 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 08:59:47,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:47,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 08:59:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:47,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:48,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2364#true} is VALID [2022-04-08 08:59:48,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2364#true} is VALID [2022-04-08 08:59:48,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-08 08:59:48,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-08 08:59:48,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret37 := main(); {2364#true} is VALID [2022-04-08 08:59:48,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {2394#(<= 5 main_~n~0)} is VALID [2022-04-08 08:59:48,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {2394#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:48,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:48,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:48,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:48,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:48,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:48,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~i~0 == ~j~0); {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:48,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:48,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:48,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:48,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !(~i~0 == ~j~0); {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:48,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:48,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:48,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:48,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !(~i~0 == ~j~0); {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:48,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:48,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2450#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:48,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {2450#(and (<= 5 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 <= ~n~0); {2365#false} is VALID [2022-04-08 08:59:48,200 INFO L272 TraceCheckUtils]: 24: Hoare triple {2365#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {2365#false} is VALID [2022-04-08 08:59:48,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-08 08:59:48,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-08 08:59:48,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-08 08:59:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:48,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:48,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-08 08:59:48,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-08 08:59:48,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-08 08:59:48,356 INFO L272 TraceCheckUtils]: 24: Hoare triple {2365#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {2365#false} is VALID [2022-04-08 08:59:48,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {2478#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {2365#false} is VALID [2022-04-08 08:59:48,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {2482#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2478#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 08:59:48,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {2482#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2482#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:48,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {2482#(<= (+ main_~j~0 1) main_~n~0)} assume !(~i~0 == ~j~0); {2482#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:48,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {2482#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2482#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:48,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {2495#(<= (+ main_~j~0 2) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2482#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:48,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {2495#(<= (+ main_~j~0 2) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2495#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:48,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {2495#(<= (+ main_~j~0 2) main_~n~0)} assume !(~i~0 == ~j~0); {2495#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:48,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {2495#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2495#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:48,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {2508#(<= (+ main_~j~0 3) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2495#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:48,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {2508#(<= (+ main_~j~0 3) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2508#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-08 08:59:48,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {2508#(<= (+ main_~j~0 3) main_~n~0)} assume !(~i~0 == ~j~0); {2508#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-08 08:59:48,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {2508#(<= (+ main_~j~0 3) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2508#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-08 08:59:48,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {2521#(<= (+ main_~j~0 4) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2508#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-08 08:59:48,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {2521#(<= (+ main_~j~0 4) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2521#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-08 08:59:48,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {2521#(<= (+ main_~j~0 4) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {2521#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-08 08:59:48,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {2521#(<= (+ main_~j~0 4) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2521#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-08 08:59:48,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {2534#(<= 4 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {2521#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-08 08:59:48,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {2534#(<= 4 main_~n~0)} is VALID [2022-04-08 08:59:48,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret37 := main(); {2364#true} is VALID [2022-04-08 08:59:48,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-08 08:59:48,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-08 08:59:48,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2364#true} is VALID [2022-04-08 08:59:48,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2364#true} is VALID [2022-04-08 08:59:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:48,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596007199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:48,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:48,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-04-08 08:59:48,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:48,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [403835213] [2022-04-08 08:59:48,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [403835213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:48,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:48,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:59:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213719948] [2022-04-08 08:59:48,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:48,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:59:48,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:48,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:48,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:48,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 08:59:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:48,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 08:59:48,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2022-04-08 08:59:48,383 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:48,580 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-08 08:59:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 08:59:48,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:59:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-04-08 08:59:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-04-08 08:59:48,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2022-04-08 08:59:48,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:48,623 INFO L225 Difference]: With dead ends: 92 [2022-04-08 08:59:48,623 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 08:59:48,623 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2022-04-08 08:59:48,624 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 39 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:48,624 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 41 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 08:59:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2022-04-08 08:59:48,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:48,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 59 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:48,663 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 59 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:48,664 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 59 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:48,665 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-04-08 08:59:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-04-08 08:59:48,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:48,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:48,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 65 states. [2022-04-08 08:59:48,665 INFO L87 Difference]: Start difference. First operand has 59 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 65 states. [2022-04-08 08:59:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:48,667 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-04-08 08:59:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-04-08 08:59:48,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:48,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:48,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:48,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-04-08 08:59:48,668 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 28 [2022-04-08 08:59:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:48,668 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-04-08 08:59:48,668 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:48,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 66 transitions. [2022-04-08 08:59:48,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-08 08:59:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:59:48,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:48,720 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:48,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:48,936 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:48,937 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1026934172, now seen corresponding path program 7 times [2022-04-08 08:59:48,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:48,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1288853247] [2022-04-08 08:59:48,950 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:48,950 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:48,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1026934172, now seen corresponding path program 8 times [2022-04-08 08:59:48,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:48,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135700016] [2022-04-08 08:59:48,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:48,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:49,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:49,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {3003#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2991#true} is VALID [2022-04-08 08:59:49,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-08 08:59:49,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-08 08:59:49,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {2991#true} call ULTIMATE.init(); {3003#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:49,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {3003#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2991#true} is VALID [2022-04-08 08:59:49,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-08 08:59:49,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-08 08:59:49,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret37 := main(); {2991#true} is VALID [2022-04-08 08:59:49,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {2991#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {2996#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-08 08:59:49,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {2996#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:49,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:49,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} assume !(~i~0 == ~j~0); {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:49,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:49,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3002#(and (<= main_~j~0 5) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-08 08:59:49,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {3002#(and (<= main_~j~0 5) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {2992#false} is VALID [2022-04-08 08:59:49,084 INFO L272 TraceCheckUtils]: 28: Hoare triple {2992#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {2992#false} is VALID [2022-04-08 08:59:49,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2022-04-08 08:59:49,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {2992#false} assume 0 == ~cond; {2992#false} is VALID [2022-04-08 08:59:49,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2022-04-08 08:59:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:49,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:49,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135700016] [2022-04-08 08:59:49,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135700016] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:49,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155442237] [2022-04-08 08:59:49,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:49,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:49,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:49,097 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:49,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 08:59:49,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:49,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:49,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 08:59:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:49,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:49,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {2991#true} call ULTIMATE.init(); {2991#true} is VALID [2022-04-08 08:59:49,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {2991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2991#true} is VALID [2022-04-08 08:59:49,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-08 08:59:49,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-08 08:59:49,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret37 := main(); {2991#true} is VALID [2022-04-08 08:59:49,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {2991#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {3022#(<= 5 main_~n~0)} is VALID [2022-04-08 08:59:49,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {3022#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:49,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:49,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:49,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-08 08:59:49,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:49,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:49,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~i~0 == ~j~0); {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:49,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-08 08:59:49,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:49,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:49,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !(~i~0 == ~j~0); {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:49,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-08 08:59:49,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:49,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:49,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !(~i~0 == ~j~0); {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:49,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-08 08:59:49,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:49,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:49,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} assume !(~i~0 == ~j~0); {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:49,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-08 08:59:49,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3091#(and (<= 5 main_~n~0) (<= main_~j~0 5))} is VALID [2022-04-08 08:59:49,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {3091#(and (<= 5 main_~n~0) (<= main_~j~0 5))} assume !(~j~0 <= ~n~0); {2992#false} is VALID [2022-04-08 08:59:49,482 INFO L272 TraceCheckUtils]: 28: Hoare triple {2992#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {2992#false} is VALID [2022-04-08 08:59:49,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2022-04-08 08:59:49,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {2992#false} assume 0 == ~cond; {2992#false} is VALID [2022-04-08 08:59:49,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2022-04-08 08:59:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:49,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:49,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2022-04-08 08:59:49,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {2992#false} assume 0 == ~cond; {2992#false} is VALID [2022-04-08 08:59:49,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2022-04-08 08:59:49,705 INFO L272 TraceCheckUtils]: 28: Hoare triple {2992#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {2992#false} is VALID [2022-04-08 08:59:49,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {3119#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {2992#false} is VALID [2022-04-08 08:59:49,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {3123#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3119#(<= main_~j~0 main_~n~0)} is VALID [2022-04-08 08:59:49,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {3123#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3123#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:49,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {3123#(<= (+ main_~j~0 1) main_~n~0)} assume !(~i~0 == ~j~0); {3123#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:49,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {3123#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3123#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:49,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {3136#(<= (+ main_~j~0 2) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3123#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 08:59:49,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {3136#(<= (+ main_~j~0 2) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3136#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:49,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {3136#(<= (+ main_~j~0 2) main_~n~0)} assume !(~i~0 == ~j~0); {3136#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:49,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {3136#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3136#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:49,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {3149#(<= (+ main_~j~0 3) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3136#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-08 08:59:49,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {3149#(<= (+ main_~j~0 3) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3149#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-08 08:59:49,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {3149#(<= (+ main_~j~0 3) main_~n~0)} assume !(~i~0 == ~j~0); {3149#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-08 08:59:49,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {3149#(<= (+ main_~j~0 3) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3149#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-08 08:59:49,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {3162#(<= (+ main_~j~0 4) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3149#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-08 08:59:49,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {3162#(<= (+ main_~j~0 4) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3162#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-08 08:59:49,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {3162#(<= (+ main_~j~0 4) main_~n~0)} assume !(~i~0 == ~j~0); {3162#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-08 08:59:49,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {3162#(<= (+ main_~j~0 4) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3162#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-08 08:59:49,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {3175#(<= (+ 5 main_~j~0) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3162#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-08 08:59:49,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {3175#(<= (+ 5 main_~j~0) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3175#(<= (+ 5 main_~j~0) main_~n~0)} is VALID [2022-04-08 08:59:49,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {3175#(<= (+ 5 main_~j~0) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {3175#(<= (+ 5 main_~j~0) main_~n~0)} is VALID [2022-04-08 08:59:49,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {3175#(<= (+ 5 main_~j~0) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3175#(<= (+ 5 main_~j~0) main_~n~0)} is VALID [2022-04-08 08:59:49,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {3022#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {3175#(<= (+ 5 main_~j~0) main_~n~0)} is VALID [2022-04-08 08:59:49,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {2991#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {3022#(<= 5 main_~n~0)} is VALID [2022-04-08 08:59:49,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret37 := main(); {2991#true} is VALID [2022-04-08 08:59:49,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-08 08:59:49,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-08 08:59:49,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {2991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2991#true} is VALID [2022-04-08 08:59:49,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {2991#true} call ULTIMATE.init(); {2991#true} is VALID [2022-04-08 08:59:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:49,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155442237] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:49,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:49,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-04-08 08:59:49,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:49,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1288853247] [2022-04-08 08:59:49,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1288853247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:49,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:49,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 08:59:49,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495890811] [2022-04-08 08:59:49,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:49,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:59:49,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:49,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:49,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:49,733 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 08:59:49,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:49,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 08:59:49,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2022-04-08 08:59:49,734 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:49,938 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-04-08 08:59:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 08:59:49,938 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:59:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-04-08 08:59:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-04-08 08:59:49,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 67 transitions. [2022-04-08 08:59:49,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:49,983 INFO L225 Difference]: With dead ends: 98 [2022-04-08 08:59:49,983 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 08:59:49,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=401, Unknown=0, NotChecked=0, Total=600 [2022-04-08 08:59:49,986 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:49,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 33 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:59:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 08:59:50,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-08 08:59:50,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:50,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:50,055 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:50,056 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:50,057 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-08 08:59:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-08 08:59:50,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:50,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:50,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 67 states. [2022-04-08 08:59:50,064 INFO L87 Difference]: Start difference. First operand has 67 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 67 states. [2022-04-08 08:59:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:50,080 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-08 08:59:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-08 08:59:50,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:50,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:50,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:50,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-04-08 08:59:50,082 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 32 [2022-04-08 08:59:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:50,082 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-04-08 08:59:50,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:50,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 75 transitions. [2022-04-08 08:59:50,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-08 08:59:50,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 08:59:50,135 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:50,135 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:50,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:50,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:50,348 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:50,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:50,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1975029803, now seen corresponding path program 9 times [2022-04-08 08:59:50,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:50,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2125512586] [2022-04-08 08:59:50,353 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:50,353 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:50,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1975029803, now seen corresponding path program 10 times [2022-04-08 08:59:50,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:50,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9034744] [2022-04-08 08:59:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:59:50,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:59:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:59:50,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:59:50,456 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 08:59:50,456 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 08:59:50,458 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 08:59:50,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:59:50,461 INFO L719 BasicCegarLoop]: Path program histogram: [10, 4, 2, 2] [2022-04-08 08:59:50,463 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: ludcmpENTRY has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: fabsENTRY has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-08 08:59:50,476 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: ludcmpFINAL has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: ludcmpEXIT has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: fabsFINAL has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-04-08 08:59:50,477 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: fabsEXIT has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-08 08:59:50,478 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-04-08 08:59:50,479 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-08 08:59:50,479 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L149-2 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L121-2 has no Hoare annotation [2022-04-08 08:59:50,480 WARN L170 areAnnotationChecker]: L146-2 has no Hoare annotation [2022-04-08 08:59:50,481 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-04-08 08:59:50,481 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-04-08 08:59:50,481 WARN L170 areAnnotationChecker]: L129-2 has no Hoare annotation [2022-04-08 08:59:50,481 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 08:59:50,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 08:59:50 BoogieIcfgContainer [2022-04-08 08:59:50,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 08:59:50,484 INFO L158 Benchmark]: Toolchain (without parser) took 8973.37ms. Allocated memory was 173.0MB in the beginning and 249.6MB in the end (delta: 76.5MB). Free memory was 123.8MB in the beginning and 138.3MB in the end (delta: -14.5MB). Peak memory consumption was 62.2MB. Max. memory is 8.0GB. [2022-04-08 08:59:50,484 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 173.0MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:59:50,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.41ms. Allocated memory is still 173.0MB. Free memory was 123.7MB in the beginning and 148.4MB in the end (delta: -24.7MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-04-08 08:59:50,485 INFO L158 Benchmark]: Boogie Preprocessor took 47.67ms. Allocated memory is still 173.0MB. Free memory was 148.4MB in the beginning and 145.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 08:59:50,485 INFO L158 Benchmark]: RCFGBuilder took 738.24ms. Allocated memory is still 173.0MB. Free memory was 145.8MB in the beginning and 125.9MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-08 08:59:50,485 INFO L158 Benchmark]: TraceAbstraction took 7902.30ms. Allocated memory was 173.0MB in the beginning and 249.6MB in the end (delta: 76.5MB). Free memory was 125.3MB in the beginning and 138.3MB in the end (delta: -13.0MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. [2022-04-08 08:59:50,486 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 173.0MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.41ms. Allocated memory is still 173.0MB. Free memory was 123.7MB in the beginning and 148.4MB in the end (delta: -24.7MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.67ms. Allocated memory is still 173.0MB. Free memory was 148.4MB in the beginning and 145.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 738.24ms. Allocated memory is still 173.0MB. Free memory was 145.8MB in the beginning and 125.9MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 7902.30ms. Allocated memory was 173.0MB in the beginning and 249.6MB in the end (delta: 76.5MB). Free memory was 125.3MB in the beginning and 138.3MB in the end (delta: -13.0MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_real at line 98, overapproximation of someBinaryArithmeticDOUBLEoperation at line 100. Possible FailurePath: [L71] double a[50][50], b[50], x[50]; [L88] int i, j, nmax = 50, n = 5, chkerr; [L89] double eps, w; [L91] eps = 1.0e-6 [L93] i = 0 [L93] COND TRUE i <= n [L95] w = 0.0 [L96] j = 0 [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) [L99] COND TRUE i == j [L99] EXPR a[i][j] [L99] a[i][j] *= 10.0 [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) [L99] COND FALSE !(i == j) [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) [L99] COND FALSE !(i == j) [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) [L99] COND FALSE !(i == j) [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) [L99] COND FALSE !(i == j) [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) [L99] COND FALSE !(i == j) [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ [L96] COND FALSE !(j <= n) [L102] CALL __VERIFIER_assert(i==2) [L6] COND TRUE !(cond) [L7] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 265 mSDsluCounter, 294 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 412 IncrementalHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 175 mSDtfsCounter, 412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=8, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 35 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-08 08:59:50,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...