./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f1855ccd5ef0c8491e97368f082ce5aab941ff0c5bf681c3496fd6584d783f6d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 21:41:27,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 21:41:27,651 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-12-05 21:41:27,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 21:41:27,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 21:41:27,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 21:41:27,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 21:41:27,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 21:41:27,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 21:41:27,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 21:41:27,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 21:41:27,680 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-05 21:41:27,680 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-05 21:41:27,681 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-05 21:41:27,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 21:41:27,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-05 21:41:27,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 21:41:27,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 21:41:27,681 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 21:41:27,681 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 21:41:27,681 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 21:41:27,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 21:41:27,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 21:41:27,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 21:41:27,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 21:41:27,682 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 21:41:27,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 21:41:27,682 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_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> f1855ccd5ef0c8491e97368f082ce5aab941ff0c5bf681c3496fd6584d783f6d [2024-12-05 21:41:27,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 21:41:27,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 21:41:27,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 21:41:27,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 21:41:27,953 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 21:41:27,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i [2024-12-05 21:41:30,901 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/data/4879a67d8/7159ce8756d64bea9688ae73a5c170e1/FLAG68e79921e [2024-12-05 21:41:31,098 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 21:41:31,099 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i [2024-12-05 21:41:31,111 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/data/4879a67d8/7159ce8756d64bea9688ae73a5c170e1/FLAG68e79921e [2024-12-05 21:41:31,127 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/data/4879a67d8/7159ce8756d64bea9688ae73a5c170e1 [2024-12-05 21:41:31,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 21:41:31,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 21:41:31,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 21:41:31,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 21:41:31,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 21:41:31,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a57ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31, skipping insertion in model container [2024-12-05 21:41:31,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 21:41:31,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 21:41:31,400 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 21:41:31,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 21:41:31,461 INFO L204 MainTranslator]: Completed translation [2024-12-05 21:41:31,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31 WrapperNode [2024-12-05 21:41:31,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 21:41:31,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 21:41:31,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 21:41:31,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 21:41:31,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,497 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-12-05 21:41:31,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 21:41:31,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 21:41:31,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 21:41:31,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 21:41:31,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,511 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 21:41:31,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 21:41:31,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 21:41:31,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 21:41:31,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 21:41:31,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 21:41:31,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 21:41:31,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 21:41:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-05 21:41:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-05 21:41:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-05 21:41:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-05 21:41:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 21:41:31,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 21:41:31,660 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 21:41:31,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 21:41:31,857 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-12-05 21:41:31,857 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 21:41:31,892 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 21:41:31,892 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-05 21:41:31,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:41:31 BoogieIcfgContainer [2024-12-05 21:41:31,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 21:41:31,893 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 21:41:31,893 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 21:41:31,901 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 21:41:31,901 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:41:31" (1/1) ... [2024-12-05 21:41:31,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 21:41:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 44 states and 48 transitions. [2024-12-05 21:41:31,952 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2024-12-05 21:41:31,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-05 21:41:31,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:31,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 43 states and 47 transitions. [2024-12-05 21:41:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-12-05 21:41:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-05 21:41:32,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:32,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 42 states and 46 transitions. [2024-12-05 21:41:32,479 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-12-05 21:41:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-05 21:41:32,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:32,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:32,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 41 states and 45 transitions. [2024-12-05 21:41:32,658 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-12-05 21:41:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-05 21:41:32,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 40 states and 44 transitions. [2024-12-05 21:41:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-12-05 21:41:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-05 21:41:32,995 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:32,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 39 states and 43 transitions. [2024-12-05 21:41:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-12-05 21:41:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-05 21:41:33,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:33,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 38 states and 42 transitions. [2024-12-05 21:41:33,852 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-12-05 21:41:33,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-05 21:41:33,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:33,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 39 states and 44 transitions. [2024-12-05 21:41:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-12-05 21:41:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-05 21:41:34,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:34,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 40 states and 48 transitions. [2024-12-05 21:41:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-12-05 21:41:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 21:41:34,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:34,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 43 states and 55 transitions. [2024-12-05 21:41:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-12-05 21:41:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 21:41:34,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 46 states and 63 transitions. [2024-12-05 21:41:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-12-05 21:41:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-05 21:41:35,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:35,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 47 states and 65 transitions. [2024-12-05 21:41:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-12-05 21:41:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-05 21:41:35,289 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:35,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 49 states and 71 transitions. [2024-12-05 21:41:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2024-12-05 21:41:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-05 21:41:35,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:35,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 52 states and 79 transitions. [2024-12-05 21:41:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-12-05 21:41:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-05 21:41:35,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:35,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 52 states and 78 transitions. [2024-12-05 21:41:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2024-12-05 21:41:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-05 21:41:35,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 57 states and 91 transitions. [2024-12-05 21:41:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 91 transitions. [2024-12-05 21:41:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-05 21:41:36,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:36,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 58 states and 92 transitions. [2024-12-05 21:41:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 92 transitions. [2024-12-05 21:41:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-05 21:41:36,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:36,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 63 states and 104 transitions. [2024-12-05 21:41:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2024-12-05 21:41:37,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-05 21:41:37,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:37,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-12-05 21:41:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 67 states and 110 transitions. [2024-12-05 21:41:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 110 transitions. [2024-12-05 21:41:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-05 21:41:37,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:37,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:38,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 71 states and 116 transitions. [2024-12-05 21:41:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 116 transitions. [2024-12-05 21:41:38,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-05 21:41:38,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:38,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 72 states and 119 transitions. [2024-12-05 21:41:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 119 transitions. [2024-12-05 21:41:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-05 21:41:38,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:38,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 74 states and 124 transitions. [2024-12-05 21:41:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 124 transitions. [2024-12-05 21:41:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-05 21:41:38,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:38,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 80 states and 138 transitions. [2024-12-05 21:41:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 138 transitions. [2024-12-05 21:41:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-05 21:41:40,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:40,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 79 states and 137 transitions. [2024-12-05 21:41:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 137 transitions. [2024-12-05 21:41:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-05 21:41:40,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 80 states and 137 transitions. [2024-12-05 21:41:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 137 transitions. [2024-12-05 21:41:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 21:41:40,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:40,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 83 states and 148 transitions. [2024-12-05 21:41:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 148 transitions. [2024-12-05 21:41:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-05 21:41:41,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:41,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:41:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 85 states and 151 transitions. [2024-12-05 21:41:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2024-12-05 21:41:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-05 21:41:42,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:42,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:41:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 85 states and 150 transitions. [2024-12-05 21:41:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 150 transitions. [2024-12-05 21:41:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-05 21:41:42,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:42,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 86 states and 151 transitions. [2024-12-05 21:41:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 151 transitions. [2024-12-05 21:41:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-05 21:41:42,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 87 states and 152 transitions. [2024-12-05 21:41:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 152 transitions. [2024-12-05 21:41:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 21:41:42,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:42,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:42,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-05 21:41:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 92 states and 161 transitions. [2024-12-05 21:41:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 161 transitions. [2024-12-05 21:41:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 21:41:43,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:43,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-05 21:41:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 94 states and 162 transitions. [2024-12-05 21:41:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 162 transitions. [2024-12-05 21:41:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 21:41:43,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:43,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 93 states and 161 transitions. [2024-12-05 21:41:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 161 transitions. [2024-12-05 21:41:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 21:41:43,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:43,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 92 states and 160 transitions. [2024-12-05 21:41:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 160 transitions. [2024-12-05 21:41:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 21:41:43,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:43,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:41:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 92 states and 159 transitions. [2024-12-05 21:41:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 159 transitions. [2024-12-05 21:41:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 21:41:43,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:41:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 93 states and 160 transitions. [2024-12-05 21:41:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 160 transitions. [2024-12-05 21:41:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 21:41:44,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:44,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:41:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 95 states and 162 transitions. [2024-12-05 21:41:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 162 transitions. [2024-12-05 21:41:44,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 21:41:44,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:44,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:41:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 97 states and 163 transitions. [2024-12-05 21:41:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 163 transitions. [2024-12-05 21:41:44,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-05 21:41:44,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:44,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 21:41:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 102 states and 170 transitions. [2024-12-05 21:41:45,300 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 170 transitions. [2024-12-05 21:41:45,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-05 21:41:45,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 21:41:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 107 states and 177 transitions. [2024-12-05 21:41:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 177 transitions. [2024-12-05 21:41:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-05 21:41:46,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:46,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:41:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 108 states and 182 transitions. [2024-12-05 21:41:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 182 transitions. [2024-12-05 21:41:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-05 21:41:46,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:46,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:41:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 108 states and 181 transitions. [2024-12-05 21:41:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 181 transitions. [2024-12-05 21:41:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-05 21:41:47,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:47,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 21:41:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 111 states and 191 transitions. [2024-12-05 21:41:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 191 transitions. [2024-12-05 21:41:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-05 21:41:47,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:47,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 21:41:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 114 states and 197 transitions. [2024-12-05 21:41:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 197 transitions. [2024-12-05 21:41:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-05 21:41:47,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 119 states and 204 transitions. [2024-12-05 21:41:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 204 transitions. [2024-12-05 21:41:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-05 21:41:50,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:50,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 122 states and 210 transitions. [2024-12-05 21:41:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2024-12-05 21:41:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-05 21:41:52,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:52,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:41:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 127 states and 222 transitions. [2024-12-05 21:41:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 222 transitions. [2024-12-05 21:41:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-05 21:41:54,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:41:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 134 states and 232 transitions. [2024-12-05 21:41:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 232 transitions. [2024-12-05 21:41:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-05 21:41:56,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:56,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:41:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 137 states and 236 transitions. [2024-12-05 21:41:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 236 transitions. [2024-12-05 21:41:57,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-05 21:41:57,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:57,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:41:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:41:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 144 states and 243 transitions. [2024-12-05 21:41:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 243 transitions. [2024-12-05 21:41:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-05 21:41:59,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:41:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:41:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:41:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:42:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:42:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 151 states and 250 transitions. [2024-12-05 21:42:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 250 transitions. [2024-12-05 21:42:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 21:42:02,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:42:02,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:42:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:42:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 21:42:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:42:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 74 states and 116 transitions. [2024-12-05 21:42:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 116 transitions. [2024-12-05 21:42:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 21:42:04,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:42:04,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:42:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:42:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 21:42:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:42:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 53 states and 79 transitions. [2024-12-05 21:42:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2024-12-05 21:42:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-05 21:42:06,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:42:06,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:42:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:42:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:42:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:42:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 26 states and 33 transitions. [2024-12-05 21:42:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-12-05 21:42:09,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-05 21:42:09,554 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 54 iterations. [2024-12-05 21:42:09,561 INFO L726 CodeCheckObserver]: All specifications hold 25 specifications checked. All of them hold [2024-12-05 21:42:11,336 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,336 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,336 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,336 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,336 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,336 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,336 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,337 INFO L77 FloydHoareUtils]: At program point L560(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-05 21:42:11,337 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-05 21:42:11,338 INFO L77 FloydHoareUtils]: At program point L556(lines 556 563) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_test_fun_#t~mem8#1|) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-12-05 21:42:11,338 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 567 569) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-05 21:42:11,338 INFO L77 FloydHoareUtils]: At program point L552(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-12-05 21:42:11,338 INFO L77 FloydHoareUtils]: At program point L552-1(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-12-05 21:42:11,338 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,338 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,338 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,338 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,338 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,338 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,338 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK(lines 567 569) no Hoare annotation was computed. [2024-12-05 21:42:11,339 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-05 21:42:11,339 INFO L77 FloydHoareUtils]: At program point L557-1(line 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-05 21:42:11,339 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-12-05 21:42:11,339 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-05 21:42:11,339 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,339 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,339 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,339 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,339 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,339 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-05 21:42:11,340 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,340 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,340 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,340 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,340 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,340 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:42:11,340 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-05 21:42:11,340 INFO L77 FloydHoareUtils]: At program point L559-1(lines 559 562) 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 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 |ULTIMATE.start_test_fun_#t~mem10#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 .cse0) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-12-05 21:42:11,341 INFO L77 FloydHoareUtils]: At program point L559-3(lines 555 564) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-05 21:42:11,341 INFO L77 FloydHoareUtils]: At program point L555-1(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (or (not |ULTIMATE.start_test_fun_#t~short7#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-05 21:42:11,341 INFO L77 FloydHoareUtils]: At program point L555-3(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-05 21:42:11,341 INFO L77 FloydHoareUtils]: At program point L555-5(lines 555 564) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 (not |ULTIMATE.start_test_fun_#t~short7#1|) .cse2 .cse5 .cse6 .cse10 .cse11 .cse12))) [2024-12-05 21:42:11,341 INFO L77 FloydHoareUtils]: At program point L555-6(lines 555 564) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-12-05 21:42:11,341 INFO L77 FloydHoareUtils]: At program point L555-8(lines 555 564) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-05 21:42:11,346 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 21:42:11,346 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:42:11,348 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:42:11,348 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 21:42:11,349 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:42:11,349 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 21:42:11,349 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-05 21:42:11,349 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-05 21:42:11,349 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-12-05 21:42:11,349 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-12-05 21:42:11,349 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-05 21:42:11,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 21:42:11,351 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 21:42:11,351 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 21:42:11,351 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:42:11,351 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 21:42:11,351 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-05 21:42:11,351 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-05 21:42:11,351 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-05 21:42:11,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-05 21:42:11,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-05 21:42:11,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-05 21:42:11,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-05 21:42:11,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-05 21:42:11,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 21:42:11,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 21:42:11,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 21:42:11,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 09:42:11 ImpRootNode [2024-12-05 21:42:11,353 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 21:42:11,354 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 21:42:11,354 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 21:42:11,354 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 21:42:11,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:41:31" (3/4) ... [2024-12-05 21:42:11,356 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-05 21:42:11,360 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-12-05 21:42:11,360 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-05 21:42:11,360 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-05 21:42:11,361 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-05 21:42:11,416 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 21:42:11,416 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 21:42:11,416 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 21:42:11,417 INFO L158 Benchmark]: Toolchain (without parser) took 40286.21ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 92.1MB in the beginning and 321.9MB in the end (delta: -229.8MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2024-12-05 21:42:11,417 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 21:42:11,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.11ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 75.8MB in the end (delta: 16.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 21:42:11,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.38ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 74.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 21:42:11,418 INFO L158 Benchmark]: Boogie Preprocessor took 21.20ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 73.3MB in the end (delta: 953.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 21:42:11,418 INFO L158 Benchmark]: RCFGBuilder took 373.29ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 55.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-05 21:42:11,418 INFO L158 Benchmark]: CodeCheck took 39460.08ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 55.7MB in the beginning and 326.0MB in the end (delta: -270.3MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2024-12-05 21:42:11,419 INFO L158 Benchmark]: Witness Printer took 62.26ms. Allocated memory is still 402.7MB. Free memory was 326.0MB in the beginning and 321.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 21:42:11,420 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, 44 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 37.6s, OverallIterations: 54, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11394 SdHoareTripleChecker+Valid, 31.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10500 mSDsluCounter, 5294 SdHoareTripleChecker+Invalid, 27.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4467 mSDsCounter, 2785 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23967 IncrementalHoareTripleChecker+Invalid, 26752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2785 mSolverCounterUnsat, 827 mSDtfsCounter, 23967 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6599 GetRequests, 5960 SyntacticMatches, 183 SemanticMatches, 456 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110036 ImplicationChecksByTransitivity, 33.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 4939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 52 PerfectInterpolantSequences, 95/96 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 25 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.11ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 75.8MB in the end (delta: 16.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.38ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 74.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.20ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 73.3MB in the end (delta: 953.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 373.29ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 55.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 39460.08ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 55.7MB in the beginning and 326.0MB in the end (delta: -270.3MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Witness Printer took 62.26ms. Allocated memory is still 402.7MB. Free memory was 326.0MB in the beginning and 321.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] RESULT: Ultimate proved your program to be correct! [2024-12-05 21:42:11,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dec99e-4214-4aa8-8a07-4aea8988a7e1/bin/ukojak-verify-CZk0znPC7b/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