./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:31:36,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:31:36,246 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Overflow-64bit-Kojak_Default.epf [2024-11-13 22:31:36,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:31:36,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:31:36,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:31:36,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:31:36,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:31:36,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:31:36,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:31:36,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:31:36,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:31:36,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:31:36,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:31:36,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:31:36,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:31:36,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:31:36,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:31:36,300 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-13 22:31:36,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 22:31:36,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:31:36,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:31:36,303 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:31:36,303 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:31:36,303 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:31:36,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:31:36,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:31:36,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:31:36,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:31:36,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:31:36,304 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:31:36,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:31:36,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f [2024-11-13 22:31:36,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:31:36,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:31:36,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:31:36,737 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:31:36,738 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:31:36,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i Unable to find full path for "g++" [2024-11-13 22:31:39,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:31:39,354 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:31:39,355 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2024-11-13 22:31:39,374 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/data/9679be537/680a6daf92b94d86bc51bda5e300dffc/FLAGc0a15a6c0 [2024-11-13 22:31:39,392 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/data/9679be537/680a6daf92b94d86bc51bda5e300dffc [2024-11-13 22:31:39,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:31:39,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:31:39,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:31:39,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:31:39,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:31:39,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:31:39" (1/1) ... [2024-11-13 22:31:39,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ae28ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:39, skipping insertion in model container [2024-11-13 22:31:39,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:31:39" (1/1) ... [2024-11-13 22:31:39,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:31:39,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:31:39,903 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:31:39,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:31:40,006 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:31:40,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:40 WrapperNode [2024-11-13 22:31:40,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:31:40,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:31:40,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:31:40,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:31:40,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:40" (1/1) ... [2024-11-13 22:31:40,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:40" (1/1) ... [2024-11-13 22:31:40,070 INFO L138 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 140 [2024-11-13 22:31:40,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:31:40,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:31:40,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:31:40,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:31:40,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:40" (1/1) ... [2024-11-13 22:31:40,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:40" (1/1) ... [2024-11-13 22:31:40,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:40" (1/1) ... [2024-11-13 22:31:40,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:40" (1/1) ... [2024-11-13 22:31:40,100 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:40" (1/1) ... [2024-11-13 22:31:40,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:40" (1/1) ... [2024-11-13 22:31:40,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:40" (1/1) ... [2024-11-13 22:31:40,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:40" (1/1) ... [2024-11-13 22:31:40,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:31:40,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:31:40,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:31:40,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:31:40,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:31:40" (1/1) ... [2024-11-13 22:31:40,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:31:40,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:31:40,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:31:40,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:31:40,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 22:31:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 22:31:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 22:31:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 22:31:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:31:40,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:31:40,356 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:31:40,359 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:31:40,665 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-11-13 22:31:40,665 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:31:40,777 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:31:40,778 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 22:31:40,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:31:40 BoogieIcfgContainer [2024-11-13 22:31:40,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:31:40,780 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:31:40,780 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:31:40,793 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:31:40,794 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:31:40" (1/1) ... [2024-11-13 22:31:40,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:31:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 33 states and 38 transitions. [2024-11-13 22:31:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-13 22:31:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 22:31:40,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:40,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 36 states and 42 transitions. [2024-11-13 22:31:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-13 22:31:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 22:31:41,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 35 states and 41 transitions. [2024-11-13 22:31:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-13 22:31:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 22:31:42,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 39 states and 48 transitions. [2024-11-13 22:31:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-11-13 22:31:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 22:31:42,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:42,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 41 states and 50 transitions. [2024-11-13 22:31:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-11-13 22:31:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 22:31:43,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:43,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 48 states and 60 transitions. [2024-11-13 22:31:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-13 22:31:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 22:31:45,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:45,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 44 states and 52 transitions. [2024-11-13 22:31:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-11-13 22:31:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 22:31:45,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:45,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 53 states and 68 transitions. [2024-11-13 22:31:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-11-13 22:31:48,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 22:31:48,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:48,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 53 states and 67 transitions. [2024-11-13 22:31:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2024-11-13 22:31:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 22:31:48,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:48,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 59 states and 76 transitions. [2024-11-13 22:31:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2024-11-13 22:31:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:31:51,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:51,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 64 states and 88 transitions. [2024-11-13 22:31:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2024-11-13 22:31:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:31:52,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:52,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 67 states and 95 transitions. [2024-11-13 22:31:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2024-11-13 22:31:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:31:53,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:53,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 68 states and 98 transitions. [2024-11-13 22:31:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2024-11-13 22:31:56,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 22:31:56,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:56,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 70 states and 99 transitions. [2024-11-13 22:31:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2024-11-13 22:31:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 22:31:56,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:56,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:57,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:31:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 72 states and 100 transitions. [2024-11-13 22:31:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2024-11-13 22:31:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 22:31:57,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 77 states and 106 transitions. [2024-11-13 22:32:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2024-11-13 22:32:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 22:32:03,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:03,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 79 states and 107 transitions. [2024-11-13 22:32:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2024-11-13 22:32:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 22:32:04,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:04,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 82 states and 112 transitions. [2024-11-13 22:32:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2024-11-13 22:32:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 22:32:05,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 84 states and 113 transitions. [2024-11-13 22:32:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2024-11-13 22:32:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 22:32:07,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:07,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 86 states and 117 transitions. [2024-11-13 22:32:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-13 22:32:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 22:32:08,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:08,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 85 states and 116 transitions. [2024-11-13 22:32:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2024-11-13 22:32:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:32:09,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:09,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 100 states and 145 transitions. [2024-11-13 22:32:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2024-11-13 22:32:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:32:21,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 102 states and 149 transitions. [2024-11-13 22:32:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-11-13 22:32:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:32:23,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 110 states and 167 transitions. [2024-11-13 22:32:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 167 transitions. [2024-11-13 22:32:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:32:27,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:27,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 123 states and 193 transitions. [2024-11-13 22:32:38,872 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 193 transitions. [2024-11-13 22:32:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:32:38,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:38,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 127 states and 201 transitions. [2024-11-13 22:32:41,921 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 201 transitions. [2024-11-13 22:32:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:32:41,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:41,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 133 states and 212 transitions. [2024-11-13 22:32:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 212 transitions. [2024-11-13 22:32:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:32:51,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:32:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:32:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 133 states and 212 transitions. [2024-11-13 22:32:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 212 transitions. [2024-11-13 22:32:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:32:53,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:32:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:32:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:32:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 140 states and 223 transitions. [2024-11-13 22:33:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 223 transitions. [2024-11-13 22:33:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:33:05,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:05,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:11,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 144 states and 230 transitions. [2024-11-13 22:33:11,888 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 230 transitions. [2024-11-13 22:33:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:33:11,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:11,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 148 states and 236 transitions. [2024-11-13 22:33:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 236 transitions. [2024-11-13 22:33:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 22:33:15,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:15,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 151 states and 241 transitions. [2024-11-13 22:33:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 241 transitions. [2024-11-13 22:33:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 22:33:22,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:22,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 150 states and 239 transitions. [2024-11-13 22:33:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 239 transitions. [2024-11-13 22:33:24,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 22:33:24,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 152 states and 243 transitions. [2024-11-13 22:33:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 243 transitions. [2024-11-13 22:33:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 22:33:28,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 153 states and 244 transitions. [2024-11-13 22:33:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 244 transitions. [2024-11-13 22:33:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 22:33:32,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:33:32,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:33:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:33:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:33:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:33:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 63 states and 88 transitions. [2024-11-13 22:33:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2024-11-13 22:33:34,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 22:33:34,935 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 36 iterations. [2024-11-13 22:33:34,943 INFO L729 CodeCheckObserver]: All specifications hold 10 specifications checked. All of them hold [2024-11-13 22:33:42,280 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-13 22:33:42,280 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 558) no Hoare annotation was computed. [2024-11-13 22:33:42,280 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-13 22:33:42,280 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-13 22:33:42,281 INFO L77 FloydHoareUtils]: At program point L557-1(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (< .cse0 4294967296) (or (< 0 (+ .cse0 1)) (not |ULTIMATE.start_test_fun_#t~short9#1|)) (or |ULTIMATE.start_test_fun_#t~short9#1| (< .cse0 0)) (or |ULTIMATE.start_test_fun_#t~short9#1| (< (+ .cse0 .cse1) 2147483647)) (< 0 (+ 2147483649 .cse0)) (<= 0 (+ .cse1 2147483648)))) [2024-11-13 22:33:42,281 INFO L77 FloydHoareUtils]: At program point L557-2(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= |ULTIMATE.start_test_fun_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (< 0 (+ .cse0 1)) (< |ULTIMATE.start_test_fun_#t~mem7#1| 4294967296) (<= .cse0 |ULTIMATE.start_test_fun_#t~mem7#1|) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem8#1| 2147483648)))) [2024-11-13 22:33:42,281 INFO L77 FloydHoareUtils]: At program point L557-3(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= |ULTIMATE.start_test_fun_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (< 0 (+ .cse0 1)) (<= .cse0 |ULTIMATE.start_test_fun_#t~mem7#1|) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem8#1| 2147483648)))) [2024-11-13 22:33:42,281 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 559) no Hoare annotation was computed. [2024-11-13 22:33:42,282 INFO L77 FloydHoareUtils]: At program point L557-5(line 557) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse2 (+ .cse3 1)) (.cse1 (+ .cse3 .cse5)) (.cse4 (not |ULTIMATE.start_test_fun_#t~short9#1|))) (or (and .cse0 (<= .cse1 2147483646) (<= .cse2 0) (< 0 (+ 2147483649 .cse3)) .cse4) (and .cse0 (< 0 .cse2) (or (< .cse1 2147483647) .cse4) (<= 0 (+ .cse5 2147483648)))))) [2024-11-13 22:33:42,282 INFO L77 FloydHoareUtils]: At program point L557-6(line 557) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse1 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse3 (+ .cse4 1)) (.cse2 (+ .cse4 .cse5)) (.cse0 (not |ULTIMATE.start_test_fun_#t~short14#1|))) (or (and .cse0 .cse1 (<= .cse2 2147483646) (<= .cse3 0) (< 0 (+ 2147483649 .cse4))) (and .cse1 (< 0 .cse3) (or (< .cse2 2147483647) .cse0) (<= 0 (+ .cse5 2147483648)))))) [2024-11-13 22:33:42,282 INFO L77 FloydHoareUtils]: At program point L557-8(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse1 (+ .cse0 1))) (or (and |ULTIMATE.start_test_fun_#t~short13#1| (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (+ .cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) 2147483646) (<= .cse1 0) (< 0 (+ 2147483649 .cse0))) (and (< 0 .cse1) (not |ULTIMATE.start_test_fun_#t~short13#1|))))) [2024-11-13 22:33:42,283 INFO L77 FloydHoareUtils]: At program point L557-9(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= (+ |ULTIMATE.start_test_fun_#t~mem11#1| 1) 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= |ULTIMATE.start_test_fun_#t~mem11#1| .cse0) (<= (+ .cse0 |ULTIMATE.start_test_fun_#t~mem12#1|) 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem11#1| 2147483648)) (= |ULTIMATE.start_test_fun_#t~mem12#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) [2024-11-13 22:33:42,286 INFO L77 FloydHoareUtils]: At program point L557-10(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= (+ |ULTIMATE.start_test_fun_#t~mem11#1| 1) 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= |ULTIMATE.start_test_fun_#t~mem11#1| .cse0) (<= (+ .cse0 |ULTIMATE.start_test_fun_#t~mem12#1|) 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem11#1| 2147483648)) (= |ULTIMATE.start_test_fun_#t~mem12#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) [2024-11-13 22:33:42,287 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-13 22:33:42,287 INFO L77 FloydHoareUtils]: At program point L557-12(line 557) 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|))) (let ((.cse2 (not |ULTIMATE.start_test_fun_#t~short13#1|)) (.cse0 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse1 (+ 2147483649 .cse3))) (or (and .cse0 (< 0 .cse1) .cse2) (and (< 0 (+ .cse3 1)) .cse2) (let ((.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (<= 0 (+ .cse4 2147483646)) (<= (+ .cse3 .cse4) 2147483647) |ULTIMATE.start_test_fun_#t~short13#1| .cse0 (< 0 (+ .cse3 .cse4 2147483648)) (<= 0 .cse1)))))) [2024-11-13 22:33:42,287 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 22:33:42,287 INFO L77 FloydHoareUtils]: At program point L557-13(line 557) the Hoare annotation is: (let ((.cse11 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse1 (+ .cse11 .cse10)) (.cse9 (+ .cse11 .cse10 2147483648)) (.cse6 (+ 2147483649 .cse11))) (let ((.cse3 (<= 0 .cse6)) (.cse5 (<= 0 .cse9)) (.cse0 (<= 0 (+ .cse10 2147483646))) (.cse4 (not |ULTIMATE.start_test_fun_#t~short14#1|)) (.cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse7 (<= .cse1 2147483646)) (.cse8 (< 0 (+ .cse11 1)))) (or (and .cse0 (<= .cse1 2147483647) .cse2 .cse3 (<= 2147483647 .cse1)) (and .cse4 (< 2147483646 .cse1)) (and .cse5 (<= .cse6 0) .cse2 .cse7 .cse3) (and .cse4 .cse8) (and .cse4 (< .cse9 0)) (and .cse5 .cse2 .cse7 (or .cse0 .cse4) (< 0 .cse6)) (and .cse2 .cse7 .cse8 (<= 0 (+ .cse10 2147483648))))))) [2024-11-13 22:33:42,287 INFO L77 FloydHoareUtils]: At program point L557-14(line 557) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse5 (+ 2147483649 .cse12)) (.cse11 (+ .cse12 .cse8)) (.cse9 (+ .cse12 .cse8 2147483648))) (let ((.cse0 (<= 0 .cse9)) (.cse4 (<= .cse11 2147483646)) (.cse1 (<= 0 (+ .cse8 2147483646))) (.cse3 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (< 2147483646 .cse11)) (.cse6 (<= 0 .cse5)) (.cse7 (< 0 (+ .cse12 1))) (.cse2 (not |ULTIMATE.start_test_fun_#t~short18#1|))) (or (and .cse0 (or .cse1 .cse2) .cse3 .cse4 (< 0 .cse5)) (and .cse0 (<= .cse5 0) .cse3 .cse4 .cse6) (and .cse3 .cse4 .cse7 (<= 0 (+ .cse8 2147483648))) (and .cse2 (< .cse9 0)) (and .cse10 .cse2) (and .cse1 (<= .cse11 2147483647) .cse3 .cse10 .cse6) (and .cse7 .cse2))))) [2024-11-13 22:33:42,288 INFO L77 FloydHoareUtils]: At program point L557-15(line 557) the Hoare annotation is: (let ((.cse9 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse8 (+ |ULTIMATE.start_test_fun_#t~mem16#1| |ULTIMATE.start_test_fun_#t~mem15#1|)) (.cse7 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse2 (+ 2147483649 .cse9))) (let ((.cse4 (<= 0 .cse2)) (.cse0 (<= 0 (+ .cse7 2147483646))) (.cse1 (<= .cse8 2147483646)) (.cse3 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse6 (+ .cse9 1)) (.cse5 (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem16#1| |ULTIMATE.start_test_fun_#t~mem15#1| 2147483648)))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4 .cse5) (and .cse1 .cse3 (< 0 .cse6) (<= .cse7 2147483646) (<= 0 (+ .cse7 2147483648)) .cse5) (and .cse0 .cse3 .cse4 (<= .cse8 2147483647) (< 2147483646 .cse8)) (and .cse0 .cse1 .cse3 (<= .cse6 0) (< 0 .cse2) .cse5))))) [2024-11-13 22:33:42,288 INFO L77 FloydHoareUtils]: At program point L557-16(line 557) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse6 (+ |ULTIMATE.start_test_fun_#t~mem16#1| |ULTIMATE.start_test_fun_#t~mem15#1|)) (.cse4 (+ 2147483649 .cse8)) (.cse7 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse0 (<= 0 (+ .cse7 2147483646))) (.cse5 (<= 0 .cse4)) (.cse1 (<= .cse6 2147483646)) (.cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse3 (+ .cse8 1))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) (< 0 .cse4)) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse5) (and .cse0 .cse2 .cse5 (<= .cse6 2147483647) (< 2147483646 .cse6)) (and .cse1 .cse2 (< 0 .cse3) (<= .cse7 2147483646) (<= 0 (+ .cse7 2147483648))))))) [2024-11-13 22:33:42,288 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-13 22:33:42,288 INFO L77 FloydHoareUtils]: At program point L557-18(line 557) the Hoare annotation is: (let ((.cse1 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (or (not |ULTIMATE.start_test_fun_#t~short18#1|) (and (<= 0 (+ .cse0 2147483646)) .cse1 (<= 0 (+ 2147483649 .cse2))) (and .cse1 (< 0 (+ .cse2 1)) (<= 0 (+ .cse0 2147483648))))) [2024-11-13 22:33:42,289 INFO L77 FloydHoareUtils]: At program point L557-24(lines 557 560) the Hoare annotation is: (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse1 (+ .cse4 1)) (.cse5 (<= 0 (+ .cse3 2147483646))) (.cse0 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse6 (+ 2147483649 .cse4)) (.cse2 (<= .cse3 2147483646))) (or (and .cse0 (< 0 .cse1) .cse2 (<= 0 (+ .cse3 2147483648)) (< .cse4 2147483647)) (and .cse5 .cse0 (<= .cse1 0) (< 0 .cse6) .cse2) (not |ULTIMATE.start_test_fun_#t~short22#1|) (and .cse5 (<= .cse6 0) .cse0 (<= 0 .cse6) .cse2)))) [2024-11-13 22:33:42,289 INFO L77 FloydHoareUtils]: At program point L557-26(lines 557 560) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (<= .cse0 2147483647) (< .cse1 2147483648) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (< 0 (+ 2147483649 .cse1)) (<= 0 (+ .cse0 2147483648)))) [2024-11-13 22:33:42,289 INFO L77 FloydHoareUtils]: At program point L557-27(lines 557 560) the Hoare annotation is: true [2024-11-13 22:33:42,289 INFO L77 FloydHoareUtils]: At program point L558(line 558) the Hoare annotation is: (let ((.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse0 (<= 0 (+ .cse4 2147483646))) (.cse3 (+ |ULTIMATE.start_test_fun_#t~mem23#1| 2147483648)) (.cse1 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse2 (<= .cse4 2147483646))) (or (and .cse0 .cse1 (<= 0 (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem23#1|)) .cse2 (< .cse3 0)) (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_test_fun_#t~mem23#1| 0) (<= 0 .cse3)) (and (<= |ULTIMATE.start_test_fun_#t~mem23#1| 2147483646) (<= 0 |ULTIMATE.start_test_fun_#t~mem23#1|) .cse1 .cse2 (<= 0 (+ .cse4 2147483648)))))) [2024-11-13 22:33:42,289 INFO L77 FloydHoareUtils]: At program point L558-1(line 558) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (<= |ULTIMATE.start_test_fun_#t~mem23#1| 2147483646) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= 0 (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem23#1|)) (<= .cse0 2147483646) (<= 0 (+ .cse0 2147483648)))) [2024-11-13 22:33:42,289 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 559) no Hoare annotation was computed. [2024-11-13 22:33:42,289 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 22:33:42,290 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-13 22:33:42,290 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= |ULTIMATE.start_test_fun_#t~mem24#1| 2147483646) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= .cse0 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem24#1| 2147483648)) (<= 0 (+ .cse0 2147483648)))) [2024-11-13 22:33:42,290 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= |ULTIMATE.start_test_fun_#t~mem24#1| 2147483646) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= .cse0 2147483647) (<= 0 (+ .cse0 2147483648)) (<= 0 (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem24#1|)))) [2024-11-13 22:33:42,290 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 558) no Hoare annotation was computed. [2024-11-13 22:33:42,304 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:33:42,309 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:33:42,309 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2024-11-13 22:33:42,312 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:33:42,312 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:33:42,312 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-13 22:33:42,312 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!base [2024-11-13 22:33:42,312 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-13 22:33:42,312 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:33:42,312 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:33:42,312 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-13 22:33:42,313 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 22:33:42,313 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 22:33:42,313 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2024-11-13 22:33:42,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:33:42 ImpRootNode [2024-11-13 22:33:42,318 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:33:42,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:33:42,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:33:42,319 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:33:42,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:31:40" (3/4) ... [2024-11-13 22:33:42,322 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 22:33:42,332 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-13 22:33:42,333 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 22:33:42,333 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 22:33:42,333 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 22:33:42,446 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:33:42,446 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 22:33:42,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:33:42,447 INFO L158 Benchmark]: Toolchain (without parser) took 123050.03ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 91.3MB in the beginning and 380.2MB in the end (delta: -288.9MB). Peak memory consumption was 432.9MB. Max. memory is 16.1GB. [2024-11-13 22:33:42,448 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 83.9MB. Free memory is still 42.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:33:42,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 608.51ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 74.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 22:33:42,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.59ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 72.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:33:42,451 INFO L158 Benchmark]: Boogie Preprocessor took 43.76ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 71.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:33:42,451 INFO L158 Benchmark]: RCFGBuilder took 656.38ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 53.4MB in the end (delta: 18.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 22:33:42,453 INFO L158 Benchmark]: CodeCheck took 121538.03ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 53.4MB in the beginning and 388.4MB in the end (delta: -335.0MB). Peak memory consumption was 382.6MB. Max. memory is 16.1GB. [2024-11-13 22:33:42,454 INFO L158 Benchmark]: Witness Printer took 127.95ms. Allocated memory is still 838.9MB. Free memory was 388.4MB in the beginning and 380.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:33:42,456 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, 33 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 114.1s, OverallIterations: 36, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4082 SdHoareTripleChecker+Valid, 32.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3109 mSDsluCounter, 1921 SdHoareTripleChecker+Invalid, 28.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1021 mSDsCounter, 4415 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15647 IncrementalHoareTripleChecker+Invalid, 20062 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4415 mSolverCounterUnsat, 900 mSDtfsCounter, 15647 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4638 GetRequests, 3869 SyntacticMatches, 135 SemanticMatches, 634 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188760 ImplicationChecksByTransitivity, 105.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 494 NumberOfCodeBlocks, 494 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 3440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 33 PerfectInterpolantSequences, 9/16 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: 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: 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: 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: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 83.9MB. Free memory is still 42.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 608.51ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 74.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.59ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 72.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.76ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 71.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 656.38ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 53.4MB in the end (delta: 18.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 121538.03ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 53.4MB in the beginning and 388.4MB in the end (delta: -335.0MB). Peak memory consumption was 382.6MB. Max. memory is 16.1GB. * Witness Printer took 127.95ms. Allocated memory is still 838.9MB. Free memory was 388.4MB in the beginning and 380.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~z_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: ~z_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~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[~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[~z_ref~0!base,]]] RESULT: Ultimate proved your program to be correct! [2024-11-13 22:33:42,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413c0adc-b161-45d4-8488-8af81f2c119e/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE