./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 04:42:16,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 04:42:16,962 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Overflow-64bit-Kojak_Default.epf [2024-11-25 04:42:16,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 04:42:16,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 04:42:17,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 04:42:17,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 04:42:17,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 04:42:17,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 04:42:17,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 04:42:17,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 04:42:17,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 04:42:17,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 04:42:17,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 04:42:17,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 04:42:17,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 04:42:17,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 04:42:17,016 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-25 04:42:17,016 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-25 04:42:17,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 04:42:17,016 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 04:42:17,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 04:42:17,017 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 04:42:17,017 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 04:42:17,017 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 04:42:17,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 04:42:17,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:42:17,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 04:42:17,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 04:42:17,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 04:42:17,020 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 04:42:17,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 04:42:17,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 [2024-11-25 04:42:17,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 04:42:17,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 04:42:17,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 04:42:17,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 04:42:17,385 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 04:42:17,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2024-11-25 04:42:20,495 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/data/dc752f818/7b1d1f61094347c6a238d9c1f36218a8/FLAGe96c4ddb0 [2024-11-25 04:42:20,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 04:42:20,860 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2024-11-25 04:42:20,878 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/data/dc752f818/7b1d1f61094347c6a238d9c1f36218a8/FLAGe96c4ddb0 [2024-11-25 04:42:20,905 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/data/dc752f818/7b1d1f61094347c6a238d9c1f36218a8 [2024-11-25 04:42:20,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 04:42:20,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 04:42:20,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 04:42:20,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 04:42:20,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 04:42:20,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:42:20" (1/1) ... [2024-11-25 04:42:20,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5f9b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:20, skipping insertion in model container [2024-11-25 04:42:20,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:42:20" (1/1) ... [2024-11-25 04:42:20,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 04:42:21,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:42:21,267 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 04:42:21,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:42:21,368 INFO L204 MainTranslator]: Completed translation [2024-11-25 04:42:21,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21 WrapperNode [2024-11-25 04:42:21,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 04:42:21,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 04:42:21,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 04:42:21,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 04:42:21,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,420 INFO L138 Inliner]: procedures = 111, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 128 [2024-11-25 04:42:21,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 04:42:21,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 04:42:21,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 04:42:21,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 04:42:21,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 04:42:21,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 04:42:21,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 04:42:21,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 04:42:21,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:42:21,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 04:42:21,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 04:42:21,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 04:42:21,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-25 04:42:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-25 04:42:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-25 04:42:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-25 04:42:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 04:42:21,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 04:42:21,634 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 04:42:21,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 04:42:21,879 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-25 04:42:21,879 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 04:42:21,917 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 04:42:21,917 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-25 04:42:21,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:42:21 BoogieIcfgContainer [2024-11-25 04:42:21,917 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 04:42:21,918 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 04:42:21,918 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 04:42:21,930 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 04:42:21,930 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:42:21" (1/1) ... [2024-11-25 04:42:21,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 04:42:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 38 states and 45 transitions. [2024-11-25 04:42:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-25 04:42:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-25 04:42:22,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 41 states and 52 transitions. [2024-11-25 04:42:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2024-11-25 04:42:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-25 04:42:22,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:22,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 43 states and 54 transitions. [2024-11-25 04:42:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2024-11-25 04:42:23,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 04:42:23,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:23,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 47 states and 62 transitions. [2024-11-25 04:42:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2024-11-25 04:42:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 04:42:23,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:23,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 49 states and 64 transitions. [2024-11-25 04:42:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-11-25 04:42:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 04:42:24,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 56 states and 77 transitions. [2024-11-25 04:42:25,944 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-11-25 04:42:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 04:42:25,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:25,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 52 states and 69 transitions. [2024-11-25 04:42:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2024-11-25 04:42:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 04:42:26,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:26,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 61 states and 88 transitions. [2024-11-25 04:42:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-25 04:42:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 04:42:28,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 61 states and 87 transitions. [2024-11-25 04:42:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-11-25 04:42:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 04:42:29,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 67 states and 96 transitions. [2024-11-25 04:42:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-11-25 04:42:31,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 04:42:31,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:31,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 68 states and 97 transitions. [2024-11-25 04:42:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2024-11-25 04:42:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 04:42:31,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 71 states and 103 transitions. [2024-11-25 04:42:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-11-25 04:42:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 04:42:32,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:32,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 72 states and 105 transitions. [2024-11-25 04:42:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2024-11-25 04:42:34,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 04:42:34,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:34,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 74 states and 106 transitions. [2024-11-25 04:42:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2024-11-25 04:42:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 04:42:35,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 82 states and 119 transitions. [2024-11-25 04:42:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 119 transitions. [2024-11-25 04:42:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:42:39,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:39,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 89 states and 133 transitions. [2024-11-25 04:42:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 133 transitions. [2024-11-25 04:42:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:42:40,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:40,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 102 states and 156 transitions. [2024-11-25 04:42:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions. [2024-11-25 04:42:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:42:46,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:46,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 104 states and 159 transitions. [2024-11-25 04:42:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2024-11-25 04:42:47,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:42:47,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:47,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 108 states and 170 transitions. [2024-11-25 04:42:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 170 transitions. [2024-11-25 04:42:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 04:42:52,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 113 states and 185 transitions. [2024-11-25 04:42:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 185 transitions. [2024-11-25 04:42:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 04:42:56,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:42:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:42:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 116 states and 195 transitions. [2024-11-25 04:42:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 195 transitions. [2024-11-25 04:42:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 04:42:59,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:42:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:42:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:42:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:43:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 118 states and 196 transitions. [2024-11-25 04:43:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 196 transitions. [2024-11-25 04:43:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 04:43:01,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:01,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:43:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:43:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 121 states and 200 transitions. [2024-11-25 04:43:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 200 transitions. [2024-11-25 04:43:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 04:43:07,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:07,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:43:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:43:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 123 states and 201 transitions. [2024-11-25 04:43:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 201 transitions. [2024-11-25 04:43:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 04:43:08,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:43:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:43:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 124 states and 202 transitions. [2024-11-25 04:43:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 202 transitions. [2024-11-25 04:43:13,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 04:43:13,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:43:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:43:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 125 states and 204 transitions. [2024-11-25 04:43:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 204 transitions. [2024-11-25 04:43:15,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 04:43:15,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:43:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:43:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 127 states and 211 transitions. [2024-11-25 04:43:17,620 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 211 transitions. [2024-11-25 04:43:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 04:43:17,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:43:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:43:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 143 states and 240 transitions. [2024-11-25 04:43:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 240 transitions. [2024-11-25 04:43:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 04:43:28,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:28,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:43:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 04:43:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 140 states and 237 transitions. [2024-11-25 04:43:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 237 transitions. [2024-11-25 04:43:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 04:43:29,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:29,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:43:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:43:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 144 states and 249 transitions. [2024-11-25 04:43:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 249 transitions. [2024-11-25 04:43:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 04:43:39,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:39,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:43:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:43:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 159 states and 270 transitions. [2024-11-25 04:43:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 270 transitions. [2024-11-25 04:43:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 04:43:51,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:43:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:43:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 161 states and 277 transitions. [2024-11-25 04:43:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 277 transitions. [2024-11-25 04:43:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 04:43:55,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:43:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 04:43:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 163 states and 279 transitions. [2024-11-25 04:43:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 279 transitions. [2024-11-25 04:43:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 04:43:57,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:57,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:43:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:43:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:43:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 165 states and 284 transitions. [2024-11-25 04:43:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 284 transitions. [2024-11-25 04:43:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 04:43:58,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:43:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:43:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:44:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:44:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:44:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 167 states and 291 transitions. [2024-11-25 04:44:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 291 transitions. [2024-11-25 04:44:04,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 04:44:04,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:44:04,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:44:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:44:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:44:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:44:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 169 states and 295 transitions. [2024-11-25 04:44:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 295 transitions. [2024-11-25 04:44:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 04:44:08,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:44:08,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:44:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:44:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:44:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:44:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 171 states and 299 transitions. [2024-11-25 04:44:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 299 transitions. [2024-11-25 04:44:14,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 04:44:14,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:44:14,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:44:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:44:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:44:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:44:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 173 states and 302 transitions. [2024-11-25 04:44:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 302 transitions. [2024-11-25 04:44:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 04:44:22,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:44:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:44:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:44:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:44:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:44:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 174 states and 303 transitions. [2024-11-25 04:44:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 303 transitions. [2024-11-25 04:44:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 04:44:24,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:44:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:44:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:44:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:44:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:44:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 179 states and 311 transitions. [2024-11-25 04:44:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 311 transitions. [2024-11-25 04:44:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 04:44:35,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:44:35,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:44:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:44:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:44:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:44:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 181 states and 316 transitions. [2024-11-25 04:44:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 316 transitions. [2024-11-25 04:44:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 04:44:38,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:44:38,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:44:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:44:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:44:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:44:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 182 states and 317 transitions. [2024-11-25 04:44:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 317 transitions. [2024-11-25 04:44:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 04:44:39,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:44:39,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:44:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:44:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:44:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:44:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 184 states and 319 transitions. [2024-11-25 04:44:41,465 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 319 transitions. [2024-11-25 04:44:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-25 04:44:41,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:44:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:44:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:44:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:44:42,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:44:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 52 states and 66 transitions. [2024-11-25 04:44:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2024-11-25 04:44:42,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 04:44:42,644 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 44 iterations. [2024-11-25 04:44:42,652 INFO L726 CodeCheckObserver]: All specifications hold 12 specifications checked. All of them hold [2024-11-25 04:44:50,640 INFO L77 FloydHoareUtils]: At program point L555-10(line 555) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= |ULTIMATE.start_test_fun_#t~mem10#1| .cse0) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem11#1|) (<= (+ .cse0 1) 0) (<= |ULTIMATE.start_test_fun_#t~mem11#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem10#1| 2147483648)))) [2024-11-25 04:44:50,640 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-25 04:44:50,640 INFO L77 FloydHoareUtils]: At program point L555-12(line 555) the Hoare annotation is: (or (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ .cse0 1) 0) (< 0 (+ .cse1 .cse0 2147483648)) (<= .cse1 2147483647))) (not |ULTIMATE.start_test_fun_#t~short12#1|)) [2024-11-25 04:44:50,641 INFO L77 FloydHoareUtils]: At program point L555-13(line 555) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (<= 0 (+ .cse2 .cse4 2147483648))) (.cse1 (+ .cse4 1))) (or (and .cse0 (<= .cse1 0) (<= .cse2 2147483647) .cse3) (not |ULTIMATE.start_test_fun_#t~short13#1|) (and .cse0 (<= (+ .cse2 .cse4) 2147483646) (<= .cse4 2147483648) .cse3 (< 0 .cse1))))) [2024-11-25 04:44:50,641 INFO L77 FloydHoareUtils]: At program point L555-14(line 555) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (<= 0 (+ .cse2 .cse4 2147483648))) (.cse1 (+ .cse4 1))) (or (not |ULTIMATE.start_test_fun_#t~short16#1|) (and .cse0 (<= .cse1 0) (<= .cse2 2147483647) .cse3) (and .cse0 (<= (+ .cse2 .cse4) 2147483646) (<= .cse4 2147483648) .cse3 (< 0 .cse1))))) [2024-11-25 04:44:50,641 INFO L77 FloydHoareUtils]: At program point L555-15(line 555) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse5 (+ .cse2 1)) (.cse4 (+ |ULTIMATE.start_test_fun_#t~mem15#1| |ULTIMATE.start_test_fun_#t~mem14#1|)) (.cse3 (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem15#1| |ULTIMATE.start_test_fun_#t~mem14#1| 2147483648))) (.cse6 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (let ((.cse1 (+ .cse6 .cse2))) (and .cse0 (<= .cse1 2147483646) (<= .cse2 2147483648) .cse3 (<= .cse4 .cse1) (<= .cse1 .cse4) (< 0 .cse5))) (and (<= (+ |ULTIMATE.start_test_fun_#t~mem15#1| |ULTIMATE.start_test_fun_#t~mem14#1| 1) .cse6) .cse0 (<= .cse5 0) (<= .cse4 (+ 2147483647 .cse2)) .cse3 (<= .cse6 2147483647))))) [2024-11-25 04:44:50,641 INFO L77 FloydHoareUtils]: At program point L555-16(line 555) the Hoare annotation is: (let ((.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (+ |ULTIMATE.start_test_fun_#t~mem15#1| |ULTIMATE.start_test_fun_#t~mem14#1|)) (.cse2 (+ .cse4 1)) (.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (and (<= (+ |ULTIMATE.start_test_fun_#t~mem15#1| |ULTIMATE.start_test_fun_#t~mem14#1| 1) .cse0) .cse1 (<= .cse2 0) (<= .cse3 (+ 2147483647 .cse4)) (<= .cse0 2147483647)) (let ((.cse5 (+ .cse0 .cse4))) (and .cse1 (<= .cse5 2147483646) (<= .cse4 2147483648) (<= .cse3 .cse5) (<= .cse5 .cse3) (< 0 .cse2)))))) [2024-11-25 04:44:50,642 INFO L77 FloydHoareUtils]: At program point L555-18(lines 555 565) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (+ .cse2 1)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (let ((.cse1 (+ .cse4 .cse2))) (and .cse0 (<= .cse1 2147483646) (<= .cse2 2147483648) (< 0 .cse1) (< 0 .cse3))) (not |ULTIMATE.start_test_fun_#t~short16#1|) (and .cse0 (< 1 .cse4) (<= .cse3 0) (< 0 (+ 2147483647 .cse2)) (<= .cse4 2147483647))))) [2024-11-25 04:44:50,642 INFO L77 FloydHoareUtils]: At program point L555-21(lines 555 565) the Hoare annotation is: true [2024-11-25 04:44:50,642 INFO L77 FloydHoareUtils]: At program point L560(line 560) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= |ULTIMATE.start_test_fun_#t~mem22#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= 1 |ULTIMATE.start_test_fun_#t~mem22#1|) (<= |ULTIMATE.start_test_fun_#t~mem22#1| 1073741823)) [2024-11-25 04:44:50,642 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= |ULTIMATE.start_test_fun_#t~mem22#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= 1 |ULTIMATE.start_test_fun_#t~mem22#1|) (<= |ULTIMATE.start_test_fun_#t~mem22#1| 1073741823)) [2024-11-25 04:44:50,642 INFO L77 FloydHoareUtils]: At program point L556(lines 556 564) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (and .cse0 (<= 0 (+ .cse1 2147483646)) (<= (+ 2 |ULTIMATE.start_test_fun_#t~mem17#1|) (+ .cse1 |ULTIMATE.start_test_fun_#t~mem18#1|)) (<= (+ .cse1 1) 0) (<= .cse2 2147483647) (<= 2 .cse2)) (let ((.cse3 (+ (* .cse1 2) |ULTIMATE.start_test_fun_#t~mem18#1|))) (and .cse0 (<= .cse2 2147483646) (<= .cse1 2147483648) (<= (+ |ULTIMATE.start_test_fun_#t~mem17#1| 1) .cse3) (<= (+ |ULTIMATE.start_test_fun_#t~mem18#1| 1) (+ |ULTIMATE.start_test_fun_#t~mem17#1| (* .cse2 2))) (<= .cse3 (+ |ULTIMATE.start_test_fun_#t~mem17#1| 2147483646)))))) [2024-11-25 04:44:50,642 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2024-11-25 04:44:50,643 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-25 04:44:50,643 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-25 04:44:50,643 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-25 04:44:50,643 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (and (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem19#1|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= |ULTIMATE.start_test_fun_#t~mem19#1| 2147483648) (<= 1 |ULTIMATE.start_test_fun_#t~mem19#1|)) [2024-11-25 04:44:50,643 INFO L77 FloydHoareUtils]: At program point L557-1(line 557) the Hoare annotation is: (and (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem19#1|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= |ULTIMATE.start_test_fun_#t~mem19#1| 2147483648) (<= 1 |ULTIMATE.start_test_fun_#t~mem19#1|)) [2024-11-25 04:44:50,643 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2024-11-25 04:44:50,643 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-25 04:44:50,643 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 04:44:50,643 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-25 04:44:50,643 INFO L77 FloydHoareUtils]: At program point L562(line 562) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse1 (<= |ULTIMATE.start_test_fun_#t~mem23#1| 2147483646)) (.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (<= 0 (+ .cse2 2147483646)))) (or (and .cse0 .cse1 (<= 1 |ULTIMATE.start_test_fun_#t~mem23#1|) (<= .cse2 1073741823) (<= 0 .cse2)) (and .cse0 .cse1 .cse3 (<= 2 |ULTIMATE.start_test_fun_#t~mem23#1|) (< .cse2 0)) (and .cse0 .cse3 (<= (+ .cse2 1) 0) (<= |ULTIMATE.start_test_fun_#t~mem23#1| 2147483647) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem23#1|))))) [2024-11-25 04:44:50,644 INFO L77 FloydHoareUtils]: At program point L562-1(line 562) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse1 (<= |ULTIMATE.start_test_fun_#t~mem23#1| 2147483646)) (.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (<= 0 (+ .cse2 2147483646)))) (or (and .cse0 .cse1 (<= 1 |ULTIMATE.start_test_fun_#t~mem23#1|) (<= .cse2 1073741823) (<= 0 .cse2)) (and .cse0 .cse1 .cse3 (<= 2 |ULTIMATE.start_test_fun_#t~mem23#1|) (< .cse2 0)) (and .cse0 .cse3 (<= (+ .cse2 1) 0) (<= |ULTIMATE.start_test_fun_#t~mem23#1| 2147483647) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem23#1|))))) [2024-11-25 04:44:50,644 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2024-11-25 04:44:50,644 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 04:44:50,644 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-25 04:44:50,644 INFO L77 FloydHoareUtils]: At program point L559(lines 559 563) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (+ .cse1 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~mem21#1| |ULTIMATE.start_test_fun_#t~mem20#1|))) (.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (and .cse0 (or (< 0 .cse1) .cse2) (<= .cse3 2147483646) (<= .cse1 |ULTIMATE.start_test_fun_#t~mem20#1|) (<= .cse1 1073741823) (<= 1 .cse3) (= .cse3 |ULTIMATE.start_test_fun_#t~mem21#1|) (< 0 .cse4)) (and .cse0 (<= 0 (+ .cse1 2147483646)) (<= .cse4 0) .cse2 (<= .cse3 2147483647) (<= 2 .cse3))))) [2024-11-25 04:44:50,644 INFO L77 FloydHoareUtils]: At program point L559-2(lines 555 565) the Hoare annotation is: (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse2 (<= .cse3 2147483647)) (.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (and (< 2147483647 .cse0) .cse1 .cse2 (< 0 (+ .cse3 1))) (and .cse1 (< 0 (+ 2147483649 .cse3)) (<= .cse0 2147483647) .cse2 (<= 0 (+ .cse0 2147483648)))))) [2024-11-25 04:44:50,645 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2024-11-25 04:44:50,645 INFO L77 FloydHoareUtils]: At program point L555-1(line 555) the Hoare annotation is: (let ((.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (< 0 (+ .cse4 1))) (.cse2 (<= .cse4 2147483648)) (.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (and |ULTIMATE.start_test_fun_#t~short8#1| (< 2147483647 .cse0) .cse1 .cse2 .cse3) (let ((.cse5 (not |ULTIMATE.start_test_fun_#t~short8#1|))) (and .cse1 (or |ULTIMATE.start_test_fun_#t~short8#1| (< .cse4 0)) (or .cse5 .cse3) (< 0 (+ 2147483649 .cse4)) .cse2 (<= .cse0 2147483647) (or (< 0 (+ 2147483649 .cse0 .cse4)) .cse5)))))) [2024-11-25 04:44:50,645 INFO L77 FloydHoareUtils]: At program point L555-2(line 555) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem7#1| .cse0 2147483648)) (<= .cse0 2147483648) (<= |ULTIMATE.start_test_fun_#t~mem6#1| 4294967295) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem7#1|) (<= .cse0 |ULTIMATE.start_test_fun_#t~mem6#1|) (< 0 (+ .cse0 1)))) [2024-11-25 04:44:50,645 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-25 04:44:50,645 INFO L77 FloydHoareUtils]: At program point L555-3(line 555) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem7#1| .cse0 2147483648)) (<= .cse0 2147483648) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem7#1|) (<= .cse0 |ULTIMATE.start_test_fun_#t~mem6#1|) (< 0 (+ .cse0 1)))) [2024-11-25 04:44:50,646 INFO L77 FloydHoareUtils]: At program point L555-5(line 555) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (not |ULTIMATE.start_test_fun_#t~short8#1|)) (.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse2 (+ .cse1 1))) (or (and .cse0 (< 0 (+ 2147483649 .cse1)) (<= .cse2 0) (<= .cse3 2147483647) .cse4) (and .cse0 (or (< (+ .cse3 .cse1) 2147483647) .cse4) (<= .cse1 2147483648) (<= 0 (+ .cse3 .cse1 2147483648)) (< 0 .cse2))))) [2024-11-25 04:44:50,646 INFO L77 FloydHoareUtils]: At program point L555-6(line 555) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (+ .cse2 1)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse3 (not |ULTIMATE.start_test_fun_#t~short13#1|))) (or (and .cse0 (or (< (+ .cse1 .cse2) 2147483647) .cse3) (<= .cse2 2147483648) (<= 0 (+ .cse1 .cse2 2147483648)) (< 0 .cse4)) (and .cse0 (< 0 (+ 2147483649 .cse2)) (<= .cse4 0) (<= .cse1 2147483647) .cse3)))) [2024-11-25 04:44:50,646 INFO L77 FloydHoareUtils]: At program point L555-8(line 555) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse1 (+ .cse0 1))) (or (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) |ULTIMATE.start_test_fun_#t~short12#1| (< 0 (+ 2147483649 .cse0)) (<= .cse1 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647)) (and (not |ULTIMATE.start_test_fun_#t~short12#1|) (< 0 .cse1))))) [2024-11-25 04:44:50,646 INFO L77 FloydHoareUtils]: At program point L555-9(line 555) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= |ULTIMATE.start_test_fun_#t~mem10#1| .cse0) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem11#1|) (<= (+ .cse0 1) 0) (<= |ULTIMATE.start_test_fun_#t~mem11#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem10#1| 2147483648)))) [2024-11-25 04:44:50,656 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 04:44:50,657 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 04:44:50,658 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-25 04:44:50,658 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-25 04:44:50,658 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-25 04:44:50,659 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 04:44:50,659 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 04:44:50,659 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-25 04:44:50,659 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 04:44:50,659 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 04:44:50,659 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-25 04:44:50,659 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-25 04:44:50,660 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-25 04:44:50,660 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 04:44:50,660 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 04:44:50,660 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-25 04:44:50,660 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 04:44:50,660 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 04:44:50,660 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-25 04:44:50,660 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 04:44:50,661 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 04:44:50,661 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-25 04:44:50,661 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 04:44:50,661 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 04:44:50,661 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-25 04:44:50,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 04:44:50 ImpRootNode [2024-11-25 04:44:50,663 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 04:44:50,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 04:44:50,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 04:44:50,664 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 04:44:50,665 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:42:21" (3/4) ... [2024-11-25 04:44:50,667 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 04:44:50,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-25 04:44:50,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-25 04:44:50,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-25 04:44:50,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 04:44:50,761 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 04:44:50,761 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 04:44:50,761 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 04:44:50,762 INFO L158 Benchmark]: Toolchain (without parser) took 149851.47ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 93.2MB in the beginning and 887.8MB in the end (delta: -794.6MB). Peak memory consumption was 177.8MB. Max. memory is 16.1GB. [2024-11-25 04:44:50,763 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:44:50,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.37ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 76.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 04:44:50,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.07ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 75.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:44:50,764 INFO L158 Benchmark]: Boogie Preprocessor took 38.90ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 74.1MB in the end (delta: 977.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:44:50,764 INFO L158 Benchmark]: RCFGBuilder took 454.67ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 57.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 04:44:50,764 INFO L158 Benchmark]: CodeCheck took 148744.64ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 57.1MB in the beginning and 896.2MB in the end (delta: -839.1MB). Peak memory consumption was 135.8MB. Max. memory is 16.1GB. [2024-11-25 04:44:50,765 INFO L158 Benchmark]: Witness Printer took 97.90ms. Allocated memory is still 1.1GB. Free memory was 896.2MB in the beginning and 887.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 04:44:50,766 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 38 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 140.7s, OverallIterations: 44, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5825 SdHoareTripleChecker+Valid, 41.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4663 mSDsluCounter, 2160 SdHoareTripleChecker+Invalid, 36.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1082 mSDsCounter, 6828 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26015 IncrementalHoareTripleChecker+Invalid, 32843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6828 mSolverCounterUnsat, 1078 mSDtfsCounter, 26015 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7356 GetRequests, 6318 SyntacticMatches, 268 SemanticMatches, 770 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295262 ImplicationChecksByTransitivity, 132.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 682 ConstructedInterpolants, 0 QuantifiedInterpolants, 5146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 35 PerfectInterpolantSequences, 55/101 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.37ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 76.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.07ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 75.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.90ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 74.1MB in the end (delta: 977.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 454.67ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 57.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 148744.64ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 57.1MB in the beginning and 896.2MB in the end (delta: -839.1MB). Peak memory consumption was 135.8MB. Max. memory is 16.1GB. * Witness Printer took 97.90ms. Allocated memory is still 1.1GB. Free memory was 896.2MB in the beginning and 887.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] RESULT: Ultimate proved your program to be correct! [2024-11-25 04:44:50,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd29d4e-ee91-4c25-a4ec-42a91fe775ef/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE