./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/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_8580df3f-b721-4d58-b91b-3d0d808e777f/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/bin/ukojak-verify-EEHR8qb7sm/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_8580df3f-b721-4d58-b91b-3d0d808e777f/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_8580df3f-b721-4d58-b91b-3d0d808e777f/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 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:48:29,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:48:30,016 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Overflow-64bit-Kojak_Default.epf [2024-11-13 22:48:30,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:48:30,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:48:30,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:48:30,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:48:30,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:48:30,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:48:30,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:48:30,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:48:30,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:48:30,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:48:30,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:48:30,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:48:30,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:48:30,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:48:30,049 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:48:30,053 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-13 22:48:30,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 22:48:30,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:48:30,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:48:30,054 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:48:30,054 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:48:30,054 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:48:30,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:48:30,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:48:30,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:48:30,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:48:30,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:48:30,055 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:48:30,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:48:30,055 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_8580df3f-b721-4d58-b91b-3d0d808e777f/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 -> 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 [2024-11-13 22:48:30,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:48:30,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:48:30,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:48:30,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:48:30,472 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:48:30,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i Unable to find full path for "g++" [2024-11-13 22:48:32,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:48:32,965 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:48:32,966 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2024-11-13 22:48:32,980 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/bin/ukojak-verify-EEHR8qb7sm/data/a9c060cbb/326db637bca54e8fb6e8924a1c3365f3/FLAGa41bb1ad0 [2024-11-13 22:48:32,997 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/bin/ukojak-verify-EEHR8qb7sm/data/a9c060cbb/326db637bca54e8fb6e8924a1c3365f3 [2024-11-13 22:48:33,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:48:33,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:48:33,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:48:33,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:48:33,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:48:33,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:48:32" (1/1) ... [2024-11-13 22:48:33,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d095f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:48:33, skipping insertion in model container [2024-11-13 22:48:33,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:48:32" (1/1) ... [2024-11-13 22:48:33,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:48:33,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:48:33,435 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:48:33,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:48:33,523 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:48:33,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:48:33 WrapperNode [2024-11-13 22:48:33,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:48:33,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:48:33,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:48:33,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:48:33,534 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:48:33" (1/1) ... [2024-11-13 22:48:33,547 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:48:33" (1/1) ... [2024-11-13 22:48:33,572 INFO L138 Inliner]: procedures = 111, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 128 [2024-11-13 22:48:33,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:48:33,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:48:33,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:48:33,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:48:33,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:48:33" (1/1) ... [2024-11-13 22:48:33,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:48:33" (1/1) ... [2024-11-13 22:48:33,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:48:33" (1/1) ... [2024-11-13 22:48:33,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:48:33" (1/1) ... [2024-11-13 22:48:33,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:48:33" (1/1) ... [2024-11-13 22:48:33,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:48:33" (1/1) ... [2024-11-13 22:48:33,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:48:33" (1/1) ... [2024-11-13 22:48:33,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:48:33" (1/1) ... [2024-11-13 22:48:33,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:48:33,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:48:33,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:48:33,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:48:33,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:48:33" (1/1) ... [2024-11-13 22:48:33,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:48:33,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:48:33,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/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:48:33,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/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:48:33,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 22:48:33,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 22:48:33,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 22:48:33,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 22:48:33,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:48:33,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:48:33,876 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:48:33,879 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:48:34,247 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-13 22:48:34,247 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:48:34,308 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:48:34,308 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 22:48:34,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:48:34 BoogieIcfgContainer [2024-11-13 22:48:34,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:48:34,309 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:48:34,309 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:48:34,321 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:48:34,321 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:48:34" (1/1) ... [2024-11-13 22:48:34,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:48:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 38 states and 45 transitions. [2024-11-13 22:48:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-13 22:48:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 22:48:34,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:35,235 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:48:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 41 states and 49 transitions. [2024-11-13 22:48:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-13 22:48:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 22:48:35,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:35,514 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:48:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 40 states and 48 transitions. [2024-11-13 22:48:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-11-13 22:48:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 22:48:35,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:35,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:36,030 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:48:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 44 states and 55 transitions. [2024-11-13 22:48:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-11-13 22:48:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 22:48:36,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:36,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:36,489 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:48:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 46 states and 57 transitions. [2024-11-13 22:48:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-11-13 22:48:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 22:48:36,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:37,271 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:48:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 53 states and 69 transitions. [2024-11-13 22:48:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2024-11-13 22:48:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 22:48:38,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:38,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:38,420 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:48:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 49 states and 61 transitions. [2024-11-13 22:48:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-11-13 22:48:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 22:48:39,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:39,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:39,602 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:48:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 58 states and 79 transitions. [2024-11-13 22:48:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2024-11-13 22:48:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 22:48:41,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:41,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:41,682 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:48:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 58 states and 78 transitions. [2024-11-13 22:48:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-11-13 22:48:41,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 22:48:41,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:42,512 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:48:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 64 states and 87 transitions. [2024-11-13 22:48:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2024-11-13 22:48:44,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:48:44,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:44,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:44,879 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:48:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 65 states and 88 transitions. [2024-11-13 22:48:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2024-11-13 22:48:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:48:45,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:45,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:45,056 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:48:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 68 states and 94 transitions. [2024-11-13 22:48:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2024-11-13 22:48:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:48:45,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:45,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:46,521 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:48:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 69 states and 96 transitions. [2024-11-13 22:48:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2024-11-13 22:48:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 22:48:48,332 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:48,436 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:48:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 71 states and 97 transitions. [2024-11-13 22:48:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2024-11-13 22:48:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 22:48:49,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:49,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:49,692 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:48:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 79 states and 109 transitions. [2024-11-13 22:48:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2024-11-13 22:48:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 22:48:53,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:53,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:53,663 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:48:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:48:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 86 states and 123 transitions. [2024-11-13 22:48:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 123 transitions. [2024-11-13 22:48:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 22:48:55,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:48:55,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:48:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:48:56,006 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:49:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:49:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 100 states and 153 transitions. [2024-11-13 22:49:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 153 transitions. [2024-11-13 22:49:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 22:49:03,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:49:03,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:49:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:49:04,509 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:49:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:49:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 104 states and 164 transitions. [2024-11-13 22:49:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 164 transitions. [2024-11-13 22:49:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 22:49:08,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:49:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:49:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:49:08,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-13 22:49:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:49:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 106 states and 168 transitions. [2024-11-13 22:49:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 168 transitions. [2024-11-13 22:49:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:49:09,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:49:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:49:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:49:10,150 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:49:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:49:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 111 states and 183 transitions. [2024-11-13 22:49:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 183 transitions. [2024-11-13 22:49:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:49:14,713 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:49:14,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:49:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:49:15,524 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:49:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:49:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 116 states and 199 transitions. [2024-11-13 22:49:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 199 transitions. [2024-11-13 22:49:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:49:20,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:49:20,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:49:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:49:20,465 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:49:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:49:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 118 states and 200 transitions. [2024-11-13 22:49:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 200 transitions. [2024-11-13 22:49:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:49:22,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:49:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:49:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:49:23,447 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:49:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:49:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 121 states and 205 transitions. [2024-11-13 22:49:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 205 transitions. [2024-11-13 22:49:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:49:29,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:49:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:49:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:49:29,323 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:49:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:49:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 123 states and 206 transitions. [2024-11-13 22:49:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 206 transitions. [2024-11-13 22:49:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:49:30,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:49:30,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:49:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:49:31,561 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:49:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:49:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 123 states and 205 transitions. [2024-11-13 22:49:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 205 transitions. [2024-11-13 22:49:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:49:32,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:49:32,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:49:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:49:35,147 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:49:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:49:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 123 states and 204 transitions. [2024-11-13 22:49:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 204 transitions. [2024-11-13 22:49:37,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:49:37,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:49:37,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:49:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:49:38,537 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:49:50,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:49:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 139 states and 232 transitions. [2024-11-13 22:49:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 232 transitions. [2024-11-13 22:49:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 22:49:50,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:49:50,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:49:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:49:52,706 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:50:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 143 states and 244 transitions. [2024-11-13 22:50:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 244 transitions. [2024-11-13 22:50:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 22:50:01,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:01,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 158 states and 266 transitions. [2024-11-13 22:50:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 266 transitions. [2024-11-13 22:50:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 22:50:16,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:16,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:17,225 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:50:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 160 states and 274 transitions. [2024-11-13 22:50:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 274 transitions. [2024-11-13 22:50:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 22:50:20,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:21,240 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:50:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 162 states and 278 transitions. [2024-11-13 22:50:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 278 transitions. [2024-11-13 22:50:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 22:50:23,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:23,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:26,597 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:50:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 164 states and 286 transitions. [2024-11-13 22:50:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 286 transitions. [2024-11-13 22:50:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 22:50:31,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:31,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:34,281 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:50:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 166 states and 292 transitions. [2024-11-13 22:50:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 292 transitions. [2024-11-13 22:50:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 22:50:38,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:39,404 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:50:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 167 states and 293 transitions. [2024-11-13 22:50:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 293 transitions. [2024-11-13 22:50:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 22:50:40,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:40,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:43,763 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:50:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 169 states and 297 transitions. [2024-11-13 22:50:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 297 transitions. [2024-11-13 22:50:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 22:50:49,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:53,662 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:51:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 174 states and 305 transitions. [2024-11-13 22:51:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 305 transitions. [2024-11-13 22:51:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 22:51:05,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:05,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:08,697 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:51:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 176 states and 310 transitions. [2024-11-13 22:51:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 310 transitions. [2024-11-13 22:51:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 22:51:14,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:14,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:14,318 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:51:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 177 states and 312 transitions. [2024-11-13 22:51:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 312 transitions. [2024-11-13 22:51:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 22:51:15,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:15,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:15,645 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-13 22:51:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 179 states and 315 transitions. [2024-11-13 22:51:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 315 transitions. [2024-11-13 22:51:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 22:51:17,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:17,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:18,200 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:51:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 189 states and 334 transitions. [2024-11-13 22:51:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 334 transitions. [2024-11-13 22:51:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 22:51:31,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:31,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 22:51:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 190 states and 335 transitions. [2024-11-13 22:51:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 335 transitions. [2024-11-13 22:51:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 22:51:35,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:35,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 22:51:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 191 states and 336 transitions. [2024-11-13 22:51:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 336 transitions. [2024-11-13 22:51:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 22:51:39,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:39,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 22:51:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 192 states and 337 transitions. [2024-11-13 22:51:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 337 transitions. [2024-11-13 22:51:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 22:51:43,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:43,345 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:51:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 193 states and 337 transitions. [2024-11-13 22:51:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 337 transitions. [2024-11-13 22:51:44,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 22:51:44,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:44,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:44,745 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:51:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 194 states and 339 transitions. [2024-11-13 22:51:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 339 transitions. [2024-11-13 22:51:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 22:51:46,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:46,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 22:51:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 52 states and 66 transitions. [2024-11-13 22:51:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2024-11-13 22:51:47,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 22:51:47,426 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 46 iterations. [2024-11-13 22:51:47,443 INFO L729 CodeCheckObserver]: All specifications hold 12 specifications checked. All of them hold [2024-11-13 22:51:56,416 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-13 22:51:56,417 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-13 22:51:56,417 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:51:56,418 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:51:56,418 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:51:56,418 INFO L77 FloydHoareUtils]: At program point L555-15(line 555) the Hoare annotation is: (let ((.cse3 (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 ((.cse7 (+ |ULTIMATE.start_test_fun_#t~mem15#1| |ULTIMATE.start_test_fun_#t~mem14#1|)) (.cse5 (+ .cse3 .cse6))) (let ((.cse0 (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))) (.cse4 (<= .cse7 .cse5)) (.cse1 (+ .cse6 1))) (or (and .cse0 (<= .cse1 0) .cse2 (<= .cse3 2147483647) .cse4) (and .cse0 (<= .cse5 2147483646) (<= .cse6 2147483648) .cse2 .cse4 (<= .cse5 .cse7) (< 0 .cse1)))))) [2024-11-13 22:51:56,418 INFO L77 FloydHoareUtils]: At program point L555-16(line 555) the Hoare annotation is: (let ((.cse6 (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 ((.cse4 (+ |ULTIMATE.start_test_fun_#t~mem15#1| |ULTIMATE.start_test_fun_#t~mem14#1|)) (.cse1 (+ .cse6 .cse2))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse5 (+ .cse2 1)) (.cse3 (<= .cse4 .cse1))) (or (and .cse0 (<= .cse1 2147483646) (<= .cse2 2147483648) .cse3 (<= .cse1 .cse4) (< 0 .cse5)) (and .cse0 (<= .cse5 0) (<= .cse6 2147483647) .cse3))))) [2024-11-13 22:51:56,418 INFO L77 FloydHoareUtils]: At program point L555-18(lines 555 565) the Hoare annotation is: (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse4 (+ .cse3 .cse5))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse2 (< 0 .cse4)) (.cse1 (+ .cse5 1))) (or (and .cse0 (<= .cse1 0) .cse2 (<= .cse3 2147483647)) (and .cse0 (<= .cse4 2147483646) (<= .cse5 2147483648) .cse2 (< 0 .cse1)) (not |ULTIMATE.start_test_fun_#t~short16#1|))))) [2024-11-13 22:51:56,419 INFO L77 FloydHoareUtils]: At program point L555-20(lines 555 565) the Hoare annotation is: true [2024-11-13 22:51:56,419 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-13 22:51:56,419 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-13 22:51:56,419 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|))) (.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|))) (or (let ((.cse3 (+ (* .cse2 2) |ULTIMATE.start_test_fun_#t~mem18#1|))) (and .cse0 (<= .cse1 2147483646) (<= .cse2 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| (* .cse1 2))) (<= .cse3 (+ |ULTIMATE.start_test_fun_#t~mem17#1| 2147483646)))) (and .cse0 (<= (+ 2 |ULTIMATE.start_test_fun_#t~mem17#1|) (+ .cse2 |ULTIMATE.start_test_fun_#t~mem18#1|)) (<= (+ .cse2 1) 0) (<= .cse1 2147483647) (<= 1 (+ .cse1 .cse2))))) [2024-11-13 22:51:56,419 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2024-11-13 22:51:56,419 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-13 22:51:56,419 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-13 22:51:56,420 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-13 22:51:56,420 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-13 22:51:56,420 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-13 22:51:56,420 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2024-11-13 22:51:56,420 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-13 22:51:56,420 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 22:51:56,420 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-13 22:51:56,420 INFO L77 FloydHoareUtils]: At program point L562(line 562) the Hoare annotation is: (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|))) (.cse2 (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 |ULTIMATE.start_test_fun_#t~mem23#1|) (<= .cse2 1073741823) (<= 0 .cse2)) (and .cse0 .cse1 (<= 0 (+ .cse2 2147483646)) (<= 2 |ULTIMATE.start_test_fun_#t~mem23#1|) (< .cse2 0)) (and .cse0 (<= 1 (+ .cse2 |ULTIMATE.start_test_fun_#t~mem23#1|)) (<= (+ .cse2 1) 0) (<= |ULTIMATE.start_test_fun_#t~mem23#1| 2147483647)))) [2024-11-13 22:51:56,421 INFO L77 FloydHoareUtils]: At program point L562-1(line 562) the Hoare annotation is: (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|))) (.cse2 (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 |ULTIMATE.start_test_fun_#t~mem23#1|) (<= .cse2 1073741823) (<= 0 .cse2)) (and .cse0 .cse1 (<= 0 (+ .cse2 2147483646)) (<= 2 |ULTIMATE.start_test_fun_#t~mem23#1|) (< .cse2 0)) (and .cse0 (<= 1 (+ .cse2 |ULTIMATE.start_test_fun_#t~mem23#1|)) (<= (+ .cse2 1) 0) (<= |ULTIMATE.start_test_fun_#t~mem23#1| 2147483647)))) [2024-11-13 22:51:56,421 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2024-11-13 22:51:56,422 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 22:51:56,422 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-13 22:51:56,422 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 (<= .cse4 0) .cse2 (<= .cse3 2147483647) (<= 1 (+ .cse3 .cse1)))))) [2024-11-13 22:51:56,422 INFO L77 FloydHoareUtils]: At program point L559-2(lines 555 565) 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:51:56,423 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2024-11-13 22:51:56,423 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-13 22:51:56,423 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:51:56,423 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-13 22:51:56,424 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:51:56,424 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-13 22:51:56,424 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-13 22:51:56,425 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-13 22:51:56,425 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-13 22:51:56,436 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:51:56,441 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:51:56,441 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:51:56,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-13 22:51:56,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-13 22:51:56,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:51:56,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:51:56,442 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:51:56,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:51:56,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:51:56,442 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:51:56,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-13 22:51:56,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-13 22:51:56,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:51:56,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:51:56,443 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:51:56,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:51:56,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:51:56,443 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:51:56,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:51:56,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:51:56,443 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:51:56,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:51:56,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:51:56,444 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:51:56,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:51:56 ImpRootNode [2024-11-13 22:51:56,451 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:51:56,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:51:56,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:51:56,452 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:51:56,453 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:48:34" (3/4) ... [2024-11-13 22:51:56,457 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 22:51:56,468 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-13 22:51:56,469 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 22:51:56,470 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 22:51:56,470 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 22:51:56,595 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:51:56,595 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 22:51:56,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:51:56,597 INFO L158 Benchmark]: Toolchain (without parser) took 203594.66ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 91.0MB in the beginning and 889.5MB in the end (delta: -798.6MB). Peak memory consumption was 535.6MB. Max. memory is 16.1GB. [2024-11-13 22:51:56,597 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 83.9MB. Free memory is still 41.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:51:56,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.14ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 74.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 22:51:56,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.32ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 72.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:51:56,599 INFO L158 Benchmark]: Boogie Preprocessor took 28.29ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 71.9MB in the end (delta: 743.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:51:56,600 INFO L158 Benchmark]: RCFGBuilder took 705.91ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 55.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 22:51:56,601 INFO L158 Benchmark]: CodeCheck took 202141.89ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 55.8MB in the beginning and 893.9MB in the end (delta: -838.1MB). Peak memory consumption was 493.7MB. Max. memory is 16.1GB. [2024-11-13 22:51:56,602 INFO L158 Benchmark]: Witness Printer took 143.76ms. Allocated memory is still 1.5GB. Free memory was 893.9MB in the beginning and 889.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:51:56,604 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: 193.1s, OverallIterations: 46, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6198 SdHoareTripleChecker+Valid, 55.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5033 mSDsluCounter, 2197 SdHoareTripleChecker+Invalid, 48.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1063 mSDsCounter, 7516 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29266 IncrementalHoareTripleChecker+Invalid, 36782 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7516 mSolverCounterUnsat, 1134 mSDtfsCounter, 29266 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8478 GetRequests, 7340 SyntacticMatches, 286 SemanticMatches, 852 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363247 ImplicationChecksByTransitivity, 182.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 38.8s InterpolantComputationTime, 827 NumberOfCodeBlocks, 827 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 5745 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 35 PerfectInterpolantSequences, 108/161 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 - 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.39ms. Allocated memory is still 83.9MB. Free memory is still 41.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.14ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 74.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.32ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 72.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.29ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 71.9MB in the end (delta: 743.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 705.91ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 55.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 202141.89ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 55.8MB in the beginning and 893.9MB in the end (delta: -838.1MB). Peak memory consumption was 493.7MB. Max. memory is 16.1GB. * Witness Printer took 143.76ms. Allocated memory is still 1.5GB. Free memory was 893.9MB in the beginning and 889.5MB in the end (delta: 4.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-13 22:51:56,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580df3f-b721-4d58-b91b-3d0d808e777f/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