./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm --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 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:45:30,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:45:30,920 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Overflow-64bit-Kojak_Default.epf [2024-11-13 22:45:30,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:45:30,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:45:30,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:45:30,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:45:30,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:45:30,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:45:30,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:45:30,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:45:30,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:45:30,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:45:30,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:45:30,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:45:30,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:45:30,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:45:30,957 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:45:30,957 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-13 22:45:30,957 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 22:45:30,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:45:30,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:45:30,958 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:45:30,958 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:45:30,958 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:45:30,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:45:30,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:45:30,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:45:30,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:45:30,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:45:30,959 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:45:30,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:45:30,960 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_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm 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 -> 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b [2024-11-13 22:45:31,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:45:31,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:45:31,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:45:31,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:45:31,364 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:45:31,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i Unable to find full path for "g++" [2024-11-13 22:45:33,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:45:33,776 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:45:33,776 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2024-11-13 22:45:33,790 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/data/f76b9202c/e5c1ad9ec464418499c3cd81661b11dd/FLAG0b4a997e7 [2024-11-13 22:45:33,807 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/data/f76b9202c/e5c1ad9ec464418499c3cd81661b11dd [2024-11-13 22:45:33,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:45:33,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:45:33,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:45:33,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:45:33,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:45:33,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:45:33" (1/1) ... [2024-11-13 22:45:33,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca341d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:33, skipping insertion in model container [2024-11-13 22:45:33,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:45:33" (1/1) ... [2024-11-13 22:45:33,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:45:34,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:45:34,311 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:45:34,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:45:34,378 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:45:34,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:34 WrapperNode [2024-11-13 22:45:34,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:45:34,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:45:34,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:45:34,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:45:34,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:34" (1/1) ... [2024-11-13 22:45:34,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:34" (1/1) ... [2024-11-13 22:45:34,419 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 117 [2024-11-13 22:45:34,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:45:34,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:45:34,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:45:34,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:45:34,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:34" (1/1) ... [2024-11-13 22:45:34,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:34" (1/1) ... [2024-11-13 22:45:34,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:34" (1/1) ... [2024-11-13 22:45:34,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:34" (1/1) ... [2024-11-13 22:45:34,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:34" (1/1) ... [2024-11-13 22:45:34,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:34" (1/1) ... [2024-11-13 22:45:34,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:34" (1/1) ... [2024-11-13 22:45:34,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:34" (1/1) ... [2024-11-13 22:45:34,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:45:34,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:45:34,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:45:34,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:45:34,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:45:34" (1/1) ... [2024-11-13 22:45:34,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:45:34,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:45:34,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:45:34,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:45:34,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 22:45:34,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 22:45:34,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 22:45:34,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 22:45:34,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:45:34,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:45:34,687 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:45:34,689 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:45:34,976 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-13 22:45:34,976 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:45:35,017 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:45:35,017 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 22:45:35,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:45:35 BoogieIcfgContainer [2024-11-13 22:45:35,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:45:35,019 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:45:35,019 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:45:35,031 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:45:35,031 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:45:35" (1/1) ... [2024-11-13 22:45:35,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:45:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 34 states and 41 transitions. [2024-11-13 22:45:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-13 22:45:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 22:45:35,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:35,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:35,880 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-13 22:45:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 37 states and 46 transitions. [2024-11-13 22:45:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-11-13 22:45:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 22:45:36,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:36,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:36,231 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-13 22:45:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 36 states and 45 transitions. [2024-11-13 22:45:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-11-13 22:45:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 22:45:36,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:36,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:36,765 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-13 22:45:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 40 states and 52 transitions. [2024-11-13 22:45:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-13 22:45:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 22:45:37,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:37,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:37,247 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-13 22:45:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 42 states and 54 transitions. [2024-11-13 22:45:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2024-11-13 22:45:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 22:45:37,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:37,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:38,014 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-13 22:45:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 49 states and 66 transitions. [2024-11-13 22:45:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2024-11-13 22:45:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 22:45:39,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:39,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:39,338 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-13 22:45:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 45 states and 58 transitions. [2024-11-13 22:45:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-11-13 22:45:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 22:45:39,986 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:40,568 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-13 22:45:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 54 states and 76 transitions. [2024-11-13 22:45:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2024-11-13 22:45:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 22:45:42,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:42,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:42,565 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-13 22:45:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 54 states and 75 transitions. [2024-11-13 22:45:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 75 transitions. [2024-11-13 22:45:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 22:45:42,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:42,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:43,388 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-13 22:45:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 60 states and 84 transitions. [2024-11-13 22:45:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2024-11-13 22:45:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:45:45,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:45,699 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-13 22:45:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 61 states and 85 transitions. [2024-11-13 22:45:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2024-11-13 22:45:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:45:45,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:45,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:45,895 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-13 22:45:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 64 states and 90 transitions. [2024-11-13 22:45:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2024-11-13 22:45:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:45:46,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:46,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:47,374 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-13 22:45:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 64 states and 89 transitions. [2024-11-13 22:45:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2024-11-13 22:45:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 22:45:48,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:48,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:48,951 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-13 22:45:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 66 states and 90 transitions. [2024-11-13 22:45:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2024-11-13 22:45:49,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 22:45:49,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:50,120 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-13 22:45:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 74 states and 102 transitions. [2024-11-13 22:45:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2024-11-13 22:45:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 22:45:54,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:54,259 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-13 22:45:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:45:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 81 states and 115 transitions. [2024-11-13 22:45:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-13 22:45:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 22:45:55,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:45:55,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:45:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:45:56,704 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-13 22:46:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 95 states and 145 transitions. [2024-11-13 22:46:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 145 transitions. [2024-11-13 22:46:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 22:46:03,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:03,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:46:04,588 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-13 22:46:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 99 states and 158 transitions. [2024-11-13 22:46:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 158 transitions. [2024-11-13 22:46:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:46:07,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:46:08,775 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-13 22:46:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 104 states and 175 transitions. [2024-11-13 22:46:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 175 transitions. [2024-11-13 22:46:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:46:12,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:12,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:46:12,699 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-13 22:46:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 106 states and 176 transitions. [2024-11-13 22:46:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 176 transitions. [2024-11-13 22:46:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:46:13,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:13,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:46:14,268 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-13 22:46:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 104 states and 171 transitions. [2024-11-13 22:46:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 171 transitions. [2024-11-13 22:46:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:46:16,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:46:17,576 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-13 22:46:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 105 states and 175 transitions. [2024-11-13 22:46:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 175 transitions. [2024-11-13 22:46:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:46:19,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:46:19,444 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-13 22:46:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 107 states and 176 transitions. [2024-11-13 22:46:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 176 transitions. [2024-11-13 22:46:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:46:20,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:20,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:46:21,926 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-13 22:46:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 109 states and 179 transitions. [2024-11-13 22:46:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 179 transitions. [2024-11-13 22:46:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:46:25,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:25,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:46:25,648 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-13 22:46:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 125 states and 210 transitions. [2024-11-13 22:46:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 210 transitions. [2024-11-13 22:46:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 22:46:34,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:34,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:46:35,635 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-13 22:46:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 132 states and 227 transitions. [2024-11-13 22:46:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 227 transitions. [2024-11-13 22:46:41,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 22:46:41,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:41,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:46:41,942 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-13 22:46:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 133 states and 230 transitions. [2024-11-13 22:46:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 230 transitions. [2024-11-13 22:46:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 22:46:42,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:42,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:46:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 22:46:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 134 states and 232 transitions. [2024-11-13 22:46:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 232 transitions. [2024-11-13 22:46:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 22:46:43,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:46:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:46:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:46:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 149 states and 263 transitions. [2024-11-13 22:46:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 263 transitions. [2024-11-13 22:46:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 22:46:59,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:46:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:46:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:47:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 152 states and 268 transitions. [2024-11-13 22:47:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 268 transitions. [2024-11-13 22:47:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 22:47:03,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:03,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:04,034 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-13 22:47:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 154 states and 276 transitions. [2024-11-13 22:47:06,811 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 276 transitions. [2024-11-13 22:47:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 22:47:06,811 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:06,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:07,743 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-13 22:47:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 156 states and 280 transitions. [2024-11-13 22:47:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 280 transitions. [2024-11-13 22:47:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 22:47:10,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:47:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 159 states and 285 transitions. [2024-11-13 22:47:18,527 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 285 transitions. [2024-11-13 22:47:18,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 22:47:18,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:47:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 160 states and 286 transitions. [2024-11-13 22:47:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 286 transitions. [2024-11-13 22:47:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 22:47:20,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:20,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:23,466 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-13 22:47:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 162 states and 291 transitions. [2024-11-13 22:47:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 291 transitions. [2024-11-13 22:47:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 22:47:27,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:28,695 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-13 22:47:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 163 states and 292 transitions. [2024-11-13 22:47:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 292 transitions. [2024-11-13 22:47:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 22:47:29,878 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:31,539 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-13 22:47:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 165 states and 295 transitions. [2024-11-13 22:47:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 295 transitions. [2024-11-13 22:47:35,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 22:47:35,830 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:35,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:38,797 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-13 22:47:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 167 states and 298 transitions. [2024-11-13 22:47:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 298 transitions. [2024-11-13 22:47:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 22:47:43,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:43,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:44,026 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-13 22:47:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 168 states and 301 transitions. [2024-11-13 22:47:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 301 transitions. [2024-11-13 22:47:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 22:47:44,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:44,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:47:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 175 states and 310 transitions. [2024-11-13 22:47:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 310 transitions. [2024-11-13 22:47:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 22:47:54,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:54,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:54,320 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-13 22:47:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 176 states and 310 transitions. [2024-11-13 22:47:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 310 transitions. [2024-11-13 22:47:55,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 22:47:55,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:55,715 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-13 22:47:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 177 states and 312 transitions. [2024-11-13 22:47:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 312 transitions. [2024-11-13 22:47:56,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 22:47:56,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:47:56,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:47:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:47:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 22:47:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:47:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 51 states and 64 transitions. [2024-11-13 22:47:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2024-11-13 22:47:58,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 22:47:58,045 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 43 iterations. [2024-11-13 22:47:58,054 INFO L729 CodeCheckObserver]: All specifications hold 10 specifications checked. All of them hold [2024-11-13 22:48:06,810 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 (+ 9223372039002259455 |ULTIMATE.start_test_fun_#t~mem10#1|)))) [2024-11-13 22:48:06,810 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-13 22:48:06,811 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-13 22:48:06,811 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-13 22:48:06,811 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-13 22:48:06,811 INFO L77 FloydHoareUtils]: At program point L555-15(line 555) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse6 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse5 (+ |ULTIMATE.start_test_fun_#t~mem15#1| |ULTIMATE.start_test_fun_#t~mem14#1|)) (.cse4 (+ .cse0 .cse6))) (let ((.cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse2 (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem15#1| |ULTIMATE.start_test_fun_#t~mem14#1| 2147483648))) (.cse3 (<= .cse5 .cse4))) (or (and (<= (+ |ULTIMATE.start_test_fun_#t~mem15#1| |ULTIMATE.start_test_fun_#t~mem14#1| 1) .cse0) .cse1 .cse2 (<= .cse0 2147483647) .cse3 (<= .cse4 .cse5)) (and .cse1 (<= .cse0 2147483646) (<= .cse6 2147483648) (<= .cse5 2147483646) .cse2 .cse3 (< 0 (+ .cse6 1))))))) [2024-11-13 22:48:06,812 INFO L77 FloydHoareUtils]: At program point L555-16(line 555) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse3 (+ |ULTIMATE.start_test_fun_#t~mem15#1| |ULTIMATE.start_test_fun_#t~mem14#1|)) (.cse5 (+ .cse1 .cse2))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (<= .cse3 .cse5))) (or (and .cse0 (<= .cse1 2147483646) (<= .cse2 2147483648) (<= .cse3 2147483646) .cse4 (< 0 (+ .cse2 1))) (and (<= (+ |ULTIMATE.start_test_fun_#t~mem15#1| |ULTIMATE.start_test_fun_#t~mem14#1| 1) .cse1) .cse0 (<= .cse1 2147483647) .cse4 (<= .cse5 .cse3)))))) [2024-11-13 22:48:06,812 INFO L77 FloydHoareUtils]: At program point L555-18(lines 555 564) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.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 (< 0 (+ .cse1 .cse2)))) (or (and .cse0 (<= .cse1 2147483646) (<= .cse2 2147483648) .cse3) (and .cse0 (<= (+ .cse2 1) 0) .cse3 (<= .cse1 2147483647)) (not |ULTIMATE.start_test_fun_#t~short16#1|)))) [2024-11-13 22:48:06,812 INFO L77 FloydHoareUtils]: At program point L555-20(lines 555 564) the Hoare annotation is: true [2024-11-13 22:48:06,812 INFO L77 FloydHoareUtils]: At program point L560(line 560) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_test_fun_#t~mem20#1| 2147483646)) (.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.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 (<= .cse1 0) (<= 1 |ULTIMATE.start_test_fun_#t~mem20#1|) .cse2 (<= 0 .cse1)) (and .cse0 (<= 1 (+ .cse1 |ULTIMATE.start_test_fun_#t~mem20#1|)) .cse2 (< .cse1 0)) (and .cse0 (<= 0 (+ .cse1 2147483646)) (<= (+ .cse1 1) 0) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem20#1|) (<= |ULTIMATE.start_test_fun_#t~mem20#1| 2147483647)))) [2024-11-13 22:48:06,813 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_test_fun_#t~mem20#1| 2147483646)) (.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.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 (<= .cse1 0) (<= 1 |ULTIMATE.start_test_fun_#t~mem20#1|) .cse2 (<= 0 .cse1)) (and .cse0 (<= 1 (+ .cse1 |ULTIMATE.start_test_fun_#t~mem20#1|)) .cse2 (< .cse1 0)) (and .cse0 (<= 0 (+ .cse1 2147483646)) (<= (+ .cse1 1) 0) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem20#1|) (<= |ULTIMATE.start_test_fun_#t~mem20#1| 2147483647)))) [2024-11-13 22:48:06,813 INFO L77 FloydHoareUtils]: At program point L556(lines 556 563) 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 (<= (+ .cse1 1) 0) (<= (+ |ULTIMATE.start_test_fun_#t~mem17#1| 1) 0) (<= .cse2 2147483647) (<= 1 (+ .cse2 .cse1))) (and .cse0 (<= .cse2 2147483646) (<= .cse1 |ULTIMATE.start_test_fun_#t~mem17#1|) (<= .cse1 2147483648) (<= 1 (+ .cse2 |ULTIMATE.start_test_fun_#t~mem17#1|)) (<= |ULTIMATE.start_test_fun_#t~mem17#1| .cse1)))) [2024-11-13 22:48:06,813 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-13 22:48:06,813 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-13 22:48:06,813 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-13 22:48:06,813 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~mem18#1|)) (<= 1 |ULTIMATE.start_test_fun_#t~mem18#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~mem18#1| 2147483648)) [2024-11-13 22:48:06,814 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~mem18#1|)) (<= 1 |ULTIMATE.start_test_fun_#t~mem18#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~mem18#1| 2147483648)) [2024-11-13 22:48:06,814 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2024-11-13 22:48:06,814 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-13 22:48:06,814 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 22:48:06,814 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-13 22:48:06,815 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2024-11-13 22:48:06,815 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 22:48:06,815 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-13 22:48:06,815 INFO L77 FloydHoareUtils]: At program point L559(lines 559 562) 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 ((.cse4 (+ .cse1 1)) (.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_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|))) (.cse2 (<= .cse3 2147483646)) (.cse5 (<= .cse4 0)) (.cse6 (<= 1 (+ .cse1 |ULTIMATE.start_test_fun_#t~mem19#1|)))) (or (and .cse0 (<= .cse1 0) .cse2 (<= 1 .cse3) (< 0 .cse4)) (and .cse0 (< 2147483646 .cse3) (<= 0 (+ .cse1 2147483646)) .cse5 (<= .cse3 2147483647) .cse6) (and .cse0 .cse2 .cse5 (<= 1 (+ .cse3 .cse1)) .cse6))))) [2024-11-13 22:48:06,816 INFO L77 FloydHoareUtils]: At program point L559-2(lines 555 564) the Hoare annotation is: (let ((.cse1 (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_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.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 2147483648) (< 0 (+ .cse2 1))) (and .cse1 (< 0 (+ 2147483649 .cse2)) (<= .cse0 2147483647) (<= .cse2 2147483647) (<= 0 (+ .cse0 2147483648))))) [2024-11-13 22:48:06,816 INFO L77 FloydHoareUtils]: At program point L555-1(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 ((.cse5 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (<= .cse1 2147483648)) (.cse3 (< 0 (+ .cse1 1)))) (or (let ((.cse2 (not |ULTIMATE.start_test_fun_#t~short8#1|))) (and .cse0 (or |ULTIMATE.start_test_fun_#t~short8#1| (< .cse1 0)) (or .cse2 .cse3) .cse4 (< 0 (+ .cse1 9223372039002259456)) (<= .cse5 2147483647) (or (< 0 (+ 2147483649 .cse5 .cse1)) .cse2))) (and |ULTIMATE.start_test_fun_#t~short8#1| (< 2147483647 .cse5) .cse0 .cse4 .cse3)))) [2024-11-13 22:48:06,816 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| 4294967296) (= (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-13 22:48:06,816 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-13 22:48:06,817 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-13 22:48:06,817 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 (+ 9223372039002259455 .cse1)) (<= .cse2 0) (<= .cse3 2147483647) .cse4) (and .cse0 (or (< (+ .cse3 .cse1) 2147483647) .cse4) (<= .cse1 2147483648) (<= 0 (+ .cse3 .cse1 2147483648)) (< 0 .cse2))))) [2024-11-13 22:48:06,817 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 (+ 9223372039002259455 .cse2)) (<= .cse4 0) (<= .cse1 2147483647) .cse3)))) [2024-11-13 22:48:06,817 INFO L77 FloydHoareUtils]: At program point L555-8(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 (+ .cse1 1))) (or (and (not |ULTIMATE.start_test_fun_#t~short12#1|) (< 0 .cse0)) (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 (+ 9223372039002259455 .cse1)) (<= .cse0 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647))))) [2024-11-13 22:48:06,818 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 (+ 9223372039002259455 |ULTIMATE.start_test_fun_#t~mem10#1|)))) [2024-11-13 22:48:06,828 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:48:06,829 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:48:06,830 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-13 22:48:06,830 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-13 22:48:06,830 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-13 22:48:06,831 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:48:06,831 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:48:06,831 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-13 22:48:06,831 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:48:06,831 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:48:06,831 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-13 22:48:06,832 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-13 22:48:06,832 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-13 22:48:06,832 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:48:06,832 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:48:06,832 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-13 22:48:06,832 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:48:06,832 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:48:06,833 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-13 22:48:06,833 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:48:06,833 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:48:06,833 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-13 22:48:06,833 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:48:06,833 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:48:06,834 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-13 22:48:06,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:48:06 ImpRootNode [2024-11-13 22:48:06,839 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:48:06,840 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:48:06,840 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:48:06,840 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:48:06,841 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:45:35" (3/4) ... [2024-11-13 22:48:06,849 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 22:48:06,859 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-13 22:48:06,859 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 22:48:06,859 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 22:48:06,859 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 22:48:06,963 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:48:06,963 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 22:48:06,963 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:48:06,965 INFO L158 Benchmark]: Toolchain (without parser) took 153152.58ms. Allocated memory was 109.1MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 83.0MB in the beginning and 490.8MB in the end (delta: -407.8MB). Peak memory consumption was 573.6MB. Max. memory is 16.1GB. [2024-11-13 22:48:06,965 INFO L158 Benchmark]: CDTParser took 1.27ms. Allocated memory is still 83.9MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:48:06,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.63ms. Allocated memory is still 109.1MB. Free memory was 82.5MB in the beginning and 66.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 22:48:06,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.86ms. Allocated memory is still 109.1MB. Free memory was 66.4MB in the beginning and 64.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:48:06,967 INFO L158 Benchmark]: Boogie Preprocessor took 27.68ms. Allocated memory is still 109.1MB. Free memory was 64.6MB in the beginning and 63.8MB in the end (delta: 868.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:48:06,967 INFO L158 Benchmark]: RCFGBuilder took 569.48ms. Allocated memory is still 109.1MB. Free memory was 63.8MB in the beginning and 48.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 22:48:06,968 INFO L158 Benchmark]: CodeCheck took 151820.76ms. Allocated memory was 109.1MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 48.2MB in the beginning and 499.0MB in the end (delta: -450.8MB). Peak memory consumption was 531.6MB. Max. memory is 16.1GB. [2024-11-13 22:48:06,968 INFO L158 Benchmark]: Witness Printer took 123.52ms. Allocated memory is still 1.1GB. Free memory was 499.0MB in the beginning and 490.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:48:06,971 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, 34 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 143.0s, OverallIterations: 43, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6061 SdHoareTripleChecker+Valid, 46.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4966 mSDsluCounter, 3530 SdHoareTripleChecker+Invalid, 40.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2480 mSDsCounter, 6141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24385 IncrementalHoareTripleChecker+Invalid, 30526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6141 mSolverCounterUnsat, 1050 mSDtfsCounter, 24385 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7668 GetRequests, 6672 SyntacticMatches, 246 SemanticMatches, 750 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280660 ImplicationChecksByTransitivity, 133.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 697 ConstructedInterpolants, 0 QuantifiedInterpolants, 4474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 31 PerfectInterpolantSequences, 85/130 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 - 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 - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27ms. Allocated memory is still 83.9MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.63ms. Allocated memory is still 109.1MB. Free memory was 82.5MB in the beginning and 66.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.86ms. Allocated memory is still 109.1MB. Free memory was 66.4MB in the beginning and 64.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.68ms. Allocated memory is still 109.1MB. Free memory was 64.6MB in the beginning and 63.8MB in the end (delta: 868.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 569.48ms. Allocated memory is still 109.1MB. Free memory was 63.8MB in the beginning and 48.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 151820.76ms. Allocated memory was 109.1MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 48.2MB in the beginning and 499.0MB in the end (delta: -450.8MB). Peak memory consumption was 531.6MB. Max. memory is 16.1GB. * Witness Printer took 123.52ms. Allocated memory is still 1.1GB. Free memory was 499.0MB in the beginning and 490.8MB in the end (delta: 8.2MB). 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-13 22:48:07,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a728a652-5cf6-4cc9-a50d-4a7a77f3473e/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE