./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/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_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk --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.2.5-dev-a016563 [2024-11-08 23:26:30,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:26:30,995 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Overflow-64bit-Kojak_Default.epf [2024-11-08 23:26:31,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:26:31,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:26:31,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:26:31,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:26:31,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:26:31,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:26:31,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:26:31,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:26:31,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:26:31,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:26:31,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:26:31,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:26:31,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:26:31,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:26:31,047 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:26:31,047 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-08 23:26:31,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 23:26:31,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:26:31,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:26:31,052 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:26:31,052 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:26:31,052 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:26:31,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:26:31,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:26:31,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:26:31,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:26:31,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:26:31,054 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:26:31,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:26:31,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.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_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk 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-08 23:26:31,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:26:31,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:26:31,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:26:31,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:26:31,399 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:26:31,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i Unable to find full path for "g++" [2024-11-08 23:26:33,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:26:33,714 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:26:33,716 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2024-11-08 23:26:33,730 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/data/411aedea2/32059b68ef3f4445a75fcc96da7105c1/FLAGdae2da989 [2024-11-08 23:26:33,758 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/data/411aedea2/32059b68ef3f4445a75fcc96da7105c1 [2024-11-08 23:26:33,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:26:33,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:26:33,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:26:33,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:26:33,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:26:33,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:26:33" (1/1) ... [2024-11-08 23:26:33,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@423dff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:33, skipping insertion in model container [2024-11-08 23:26:33,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:26:33" (1/1) ... [2024-11-08 23:26:33,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:26:34,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:26:34,269 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:26:34,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:26:34,401 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:26:34,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:34 WrapperNode [2024-11-08 23:26:34,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:26:34,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:26:34,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:26:34,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:26:34,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:34" (1/1) ... [2024-11-08 23:26:34,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:34" (1/1) ... [2024-11-08 23:26:34,457 INFO L138 Inliner]: procedures = 111, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 128 [2024-11-08 23:26:34,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:26:34,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:26:34,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:26:34,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:26:34,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:34" (1/1) ... [2024-11-08 23:26:34,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:34" (1/1) ... [2024-11-08 23:26:34,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:34" (1/1) ... [2024-11-08 23:26:34,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:34" (1/1) ... [2024-11-08 23:26:34,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:34" (1/1) ... [2024-11-08 23:26:34,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:34" (1/1) ... [2024-11-08 23:26:34,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:34" (1/1) ... [2024-11-08 23:26:34,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:34" (1/1) ... [2024-11-08 23:26:34,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:26:34,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:26:34,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:26:34,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:26:34,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:34" (1/1) ... [2024-11-08 23:26:34,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:26:34,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:26:34,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:26:34,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:26:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 23:26:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 23:26:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 23:26:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 23:26:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:26:34,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:26:34,693 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:26:34,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:26:34,954 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-08 23:26:34,955 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:26:34,997 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:26:34,997 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:26:34,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:34 BoogieIcfgContainer [2024-11-08 23:26:34,998 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:26:34,999 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:26:34,999 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:26:35,009 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:26:35,010 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:34" (1/1) ... [2024-11-08 23:26:35,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 38 states and 45 transitions. [2024-11-08 23:26:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-08 23:26:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 23:26:35,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:35,877 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-08 23:26:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 41 states and 49 transitions. [2024-11-08 23:26:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-08 23:26:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 23:26:35,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:35,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:36,076 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-08 23:26:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 40 states and 48 transitions. [2024-11-08 23:26:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-11-08 23:26:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:26:36,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:36,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:36,446 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-08 23:26:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 44 states and 55 transitions. [2024-11-08 23:26:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-11-08 23:26:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:26:36,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:36,825 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-08 23:26:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 46 states and 57 transitions. [2024-11-08 23:26:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-11-08 23:26:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:26:37,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:37,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:37,483 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-08 23:26:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 53 states and 69 transitions. [2024-11-08 23:26:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2024-11-08 23:26:38,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:26:38,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:38,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:38,414 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-08 23:26:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 49 states and 61 transitions. [2024-11-08 23:26:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-11-08 23:26:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:26:38,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:38,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:39,356 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-08 23:26:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 58 states and 79 transitions. [2024-11-08 23:26:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2024-11-08 23:26:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:26:40,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:40,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:41,031 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-08 23:26:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 58 states and 78 transitions. [2024-11-08 23:26:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-11-08 23:26:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:26:41,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:41,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:41,676 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-08 23:26:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 64 states and 87 transitions. [2024-11-08 23:26:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2024-11-08 23:26:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:26:43,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:43,710 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-08 23:26:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 65 states and 88 transitions. [2024-11-08 23:26:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2024-11-08 23:26:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:26:43,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:43,852 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-08 23:26:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 68 states and 94 transitions. [2024-11-08 23:26:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2024-11-08 23:26:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:26:44,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:45,087 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-08 23:26:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 69 states and 96 transitions. [2024-11-08 23:26:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2024-11-08 23:26:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:26:46,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:46,486 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-08 23:26:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 71 states and 97 transitions. [2024-11-08 23:26:47,041 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2024-11-08 23:26:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:26:47,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:47,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:47,567 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-08 23:26:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 79 states and 109 transitions. [2024-11-08 23:26:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2024-11-08 23:26:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:26:50,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:50,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:50,966 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-08 23:26:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 86 states and 123 transitions. [2024-11-08 23:26:52,429 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 123 transitions. [2024-11-08 23:26:52,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:26:52,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:52,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:53,121 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-08 23:26:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 100 states and 153 transitions. [2024-11-08 23:26:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 153 transitions. [2024-11-08 23:26:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:26:59,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:00,360 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-08 23:27:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 104 states and 164 transitions. [2024-11-08 23:27:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 164 transitions. [2024-11-08 23:27:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:27:03,674 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:03,929 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-08 23:27:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:04,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 106 states and 168 transitions. [2024-11-08 23:27:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 168 transitions. [2024-11-08 23:27:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:27:04,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:04,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:05,334 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-08 23:27:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 111 states and 183 transitions. [2024-11-08 23:27:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 183 transitions. [2024-11-08 23:27:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:27:09,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:09,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:09,943 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-08 23:27:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 116 states and 199 transitions. [2024-11-08 23:27:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 199 transitions. [2024-11-08 23:27:14,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:27:14,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:14,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:14,246 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-08 23:27:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 118 states and 200 transitions. [2024-11-08 23:27:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 200 transitions. [2024-11-08 23:27:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:27:15,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:15,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:16,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-08 23:27:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 121 states and 205 transitions. [2024-11-08 23:27:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 205 transitions. [2024-11-08 23:27:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 23:27:21,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:21,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,785 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-08 23:27:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 123 states and 206 transitions. [2024-11-08 23:27:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 206 transitions. [2024-11-08 23:27:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 23:27:23,346 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:23,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,251 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-08 23:27:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 123 states and 205 transitions. [2024-11-08 23:27:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 205 transitions. [2024-11-08 23:27:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 23:27:28,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:28,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:28,762 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-08 23:27:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:29,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 123 states and 204 transitions. [2024-11-08 23:27:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 204 transitions. [2024-11-08 23:27:29,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 23:27:29,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:29,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:30,477 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-08 23:27:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 139 states and 232 transitions. [2024-11-08 23:27:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 232 transitions. [2024-11-08 23:27:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 23:27:40,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:40,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:43,116 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-08 23:27:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 143 states and 244 transitions. [2024-11-08 23:27:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 244 transitions. [2024-11-08 23:27:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 23:27:50,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:51,486 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-08 23:28:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 158 states and 266 transitions. [2024-11-08 23:28:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 266 transitions. [2024-11-08 23:28:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:28:03,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:03,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:04,551 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-08 23:28:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 160 states and 274 transitions. [2024-11-08 23:28:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 274 transitions. [2024-11-08 23:28:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:28:07,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:07,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:08,171 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-08 23:28:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 162 states and 278 transitions. [2024-11-08 23:28:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 278 transitions. [2024-11-08 23:28:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:28:10,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:12,844 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-08 23:28:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 164 states and 286 transitions. [2024-11-08 23:28:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 286 transitions. [2024-11-08 23:28:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 23:28:16,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:16,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:19,616 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-08 23:28:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 166 states and 292 transitions. [2024-11-08 23:28:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 292 transitions. [2024-11-08 23:28:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:28:23,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:24,130 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-08 23:28:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 167 states and 293 transitions. [2024-11-08 23:28:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 293 transitions. [2024-11-08 23:28:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:28:25,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:25,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:27,948 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-08 23:28:33,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 169 states and 297 transitions. [2024-11-08 23:28:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 297 transitions. [2024-11-08 23:28:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:28:33,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:36,677 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-08 23:28:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 174 states and 305 transitions. [2024-11-08 23:28:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 305 transitions. [2024-11-08 23:28:46,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:28:46,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:46,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,930 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-08 23:28:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 176 states and 310 transitions. [2024-11-08 23:28:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 310 transitions. [2024-11-08 23:28:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:28:54,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:54,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:54,757 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-08 23:28:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 177 states and 312 transitions. [2024-11-08 23:28:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 312 transitions. [2024-11-08 23:28:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:28:55,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:55,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:56,015 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-08 23:28:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 179 states and 315 transitions. [2024-11-08 23:28:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 315 transitions. [2024-11-08 23:28:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 23:28:57,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:57,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:57,840 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-08 23:29:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:29:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 180 states and 317 transitions. [2024-11-08 23:29:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 317 transitions. [2024-11-08 23:29:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 23:29:01,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:29:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:01,758 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-08 23:29:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:29:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 190 states and 335 transitions. [2024-11-08 23:29:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 335 transitions. [2024-11-08 23:29:13,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 23:29:13,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:29:13,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:13,843 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-08 23:29:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:29:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 191 states and 336 transitions. [2024-11-08 23:29:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 336 transitions. [2024-11-08 23:29:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 23:29:17,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:29:17,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:17,310 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-08 23:29:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:29:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 192 states and 337 transitions. [2024-11-08 23:29:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 337 transitions. [2024-11-08 23:29:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 23:29:20,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:29:20,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:20,934 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-08 23:29:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:29:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 193 states and 337 transitions. [2024-11-08 23:29:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 337 transitions. [2024-11-08 23:29:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 23:29:22,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:29:22,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:22,305 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-08 23:29:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:29:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 194 states and 339 transitions. [2024-11-08 23:29:23,481 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 339 transitions. [2024-11-08 23:29:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 23:29:23,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:29:23,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:23,656 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-08 23:29:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:29:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 52 states and 66 transitions. [2024-11-08 23:29:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2024-11-08 23:29:24,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:29:24,656 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 46 iterations. [2024-11-08 23:29:24,665 INFO L729 CodeCheckObserver]: All specifications hold 12 specifications checked. All of them hold [2024-11-08 23:29:33,147 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-08 23:29:33,147 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-08 23:29:33,147 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-08 23:29:33,148 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-08 23:29:33,148 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-08 23:29:33,148 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-08 23:29:33,149 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-08 23:29:33,149 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-08 23:29:33,149 INFO L77 FloydHoareUtils]: At program point L555-20(lines 555 565) the Hoare annotation is: true [2024-11-08 23:29:33,149 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-08 23:29:33,150 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-08 23:29:33,150 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-08 23:29:33,150 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2024-11-08 23:29:33,151 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-08 23:29:33,151 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-08 23:29:33,151 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-08 23:29:33,151 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-08 23:29:33,151 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-08 23:29:33,152 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2024-11-08 23:29:33,152 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-08 23:29:33,152 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 23:29:33,152 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-08 23:29:33,153 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-08 23:29:33,153 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-08 23:29:33,153 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2024-11-08 23:29:33,153 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 23:29:33,153 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2024-11-08 23:29:33,154 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-08 23:29:33,154 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-08 23:29:33,154 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2024-11-08 23:29:33,155 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-08 23:29:33,155 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-08 23:29:33,155 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-08 23:29:33,156 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-08 23:29:33,156 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-08 23:29:33,156 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-08 23:29:33,156 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-08 23:29:33,157 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-08 23:29:33,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-08 23:29:33,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-08 23:29:33,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-08 23:29:33,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-08 23:29:33,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-08 23:29:33,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-08 23:29:33,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-08 23:29:33,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-08 23:29:33,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-08 23:29:33,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-08 23:29:33,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-08 23:29:33,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-08 23:29:33,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-08 23:29:33,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-08 23:29:33,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-08 23:29:33,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-08 23:29:33,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-08 23:29:33,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-08 23:29:33,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-08 23:29:33,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-08 23:29:33,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-08 23:29:33,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-08 23:29:33,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-08 23:29:33,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-08 23:29:33,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-08 23:29:33,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:29:33 ImpRootNode [2024-11-08 23:29:33,175 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:29:33,176 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:29:33,176 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:29:33,176 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:29:33,177 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:34" (3/4) ... [2024-11-08 23:29:33,179 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:29:33,186 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-08 23:29:33,186 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 23:29:33,186 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 23:29:33,186 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:29:33,284 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:29:33,284 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 23:29:33,284 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:29:33,285 INFO L158 Benchmark]: Toolchain (without parser) took 179523.12ms. Allocated memory was 146.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 117.0MB in the beginning and 1.0GB in the end (delta: -888.9MB). Peak memory consumption was 574.3MB. Max. memory is 16.1GB. [2024-11-08 23:29:33,285 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 119.5MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:29:33,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 639.43ms. Allocated memory is still 146.8MB. Free memory was 117.0MB in the beginning and 113.3MB in the end (delta: 3.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:29:33,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.45ms. Allocated memory is still 146.8MB. Free memory was 113.3MB in the beginning and 111.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:29:33,286 INFO L158 Benchmark]: Boogie Preprocessor took 42.40ms. Allocated memory is still 146.8MB. Free memory was 111.2MB in the beginning and 109.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:29:33,286 INFO L158 Benchmark]: RCFGBuilder took 496.88ms. Allocated memory is still 146.8MB. Free memory was 109.9MB in the beginning and 91.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:29:33,287 INFO L158 Benchmark]: CodeCheck took 178176.75ms. Allocated memory was 146.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 91.7MB in the beginning and 1.0GB in the end (delta: -919.4MB). Peak memory consumption was 547.5MB. Max. memory is 16.1GB. [2024-11-08 23:29:33,287 INFO L158 Benchmark]: Witness Printer took 108.22ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:29:33,291 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: 169.6s, OverallIterations: 46, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6207 SdHoareTripleChecker+Valid, 48.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5041 mSDsluCounter, 2197 SdHoareTripleChecker+Invalid, 42.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1063 mSDsCounter, 7515 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29297 IncrementalHoareTripleChecker+Invalid, 36812 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7515 mSolverCounterUnsat, 1134 mSDtfsCounter, 29297 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8507 GetRequests, 7366 SyntacticMatches, 285 SemanticMatches, 856 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366335 ImplicationChecksByTransitivity, 159.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 33.1s InterpolantComputationTime, 827 NumberOfCodeBlocks, 827 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 5749 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.33ms. Allocated memory is still 119.5MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 639.43ms. Allocated memory is still 146.8MB. Free memory was 117.0MB in the beginning and 113.3MB in the end (delta: 3.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.45ms. Allocated memory is still 146.8MB. Free memory was 113.3MB in the beginning and 111.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.40ms. Allocated memory is still 146.8MB. Free memory was 111.2MB in the beginning and 109.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 496.88ms. Allocated memory is still 146.8MB. Free memory was 109.9MB in the beginning and 91.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 178176.75ms. Allocated memory was 146.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 91.7MB in the beginning and 1.0GB in the end (delta: -919.4MB). Peak memory consumption was 547.5MB. Max. memory is 16.1GB. * Witness Printer took 108.22ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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-08 23:29:33,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_211daade-144c-4b4e-8e48-48e347dadee4/bin/ukojak-verify-ImItNfHLgk/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