./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-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_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/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_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/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_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/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 4cca1c0210c0a53cd372224714db019427e8e227743584713b4610995b14f457 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 02:56:53,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 02:56:53,260 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-12-06 02:56:53,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 02:56:53,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 02:56:53,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 02:56:53,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 02:56:53,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 02:56:53,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 02:56:53,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 02:56:53,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 02:56:53,287 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-06 02:56:53,288 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-06 02:56:53,288 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-06 02:56:53,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 02:56:53,288 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 02:56:53,288 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 02:56:53,288 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 02:56:53,288 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 02:56:53,288 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 02:56:53,288 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 02:56:53,288 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 02:56:53,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:56:53,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 02:56:53,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 02:56:53,289 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 02:56:53,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 02:56:53,289 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_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/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 -> 4cca1c0210c0a53cd372224714db019427e8e227743584713b4610995b14f457 [2024-12-06 02:56:53,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 02:56:53,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 02:56:53,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 02:56:53,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 02:56:53,549 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 02:56:53,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2024-12-06 02:56:56,174 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/data/070a0a409/39e960e3998045e58ec17278e4c0657e/FLAG0dd123942 [2024-12-06 02:56:56,424 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 02:56:56,425 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2024-12-06 02:56:56,437 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/data/070a0a409/39e960e3998045e58ec17278e4c0657e/FLAG0dd123942 [2024-12-06 02:56:56,747 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/data/070a0a409/39e960e3998045e58ec17278e4c0657e [2024-12-06 02:56:56,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 02:56:56,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 02:56:56,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 02:56:56,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 02:56:56,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 02:56:56,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:56:56" (1/1) ... [2024-12-06 02:56:56,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9c153c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:56, skipping insertion in model container [2024-12-06 02:56:56,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:56:56" (1/1) ... [2024-12-06 02:56:56,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 02:56:56,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:56:56,985 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 02:56:57,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:56:57,031 INFO L204 MainTranslator]: Completed translation [2024-12-06 02:56:57,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57 WrapperNode [2024-12-06 02:56:57,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 02:56:57,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 02:56:57,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 02:56:57,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 02:56:57,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,060 INFO L138 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2024-12-06 02:56:57,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 02:56:57,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 02:56:57,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 02:56:57,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 02:56:57,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 02:56:57,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 02:56:57,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 02:56:57,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 02:56:57,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:56:57,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 02:56:57,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 02:56:57,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 02:56:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-06 02:56:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-06 02:56:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-06 02:56:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-06 02:56:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 02:56:57,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 02:56:57,201 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 02:56:57,202 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 02:56:57,411 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 02:56:57,411 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 02:56:57,443 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 02:56:57,443 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 02:56:57,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:56:57 BoogieIcfgContainer [2024-12-06 02:56:57,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 02:56:57,444 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 02:56:57,444 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 02:56:57,453 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 02:56:57,453 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:56:57" (1/1) ... [2024-12-06 02:56:57,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 02:56:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:56:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 61 states and 66 transitions. [2024-12-06 02:56:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-12-06 02:56:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 02:56:57,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:56:57,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:56:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:56:57,754 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-06 02:56:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:56:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 60 states and 65 transitions. [2024-12-06 02:56:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-12-06 02:56:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 02:56:57,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:56:57,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:56:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:56:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:56:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:56:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 59 states and 64 transitions. [2024-12-06 02:56:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-12-06 02:56:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 02:56:58,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:56:58,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:56:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:56:58,070 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-06 02:56:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:56:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 58 states and 63 transitions. [2024-12-06 02:56:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-12-06 02:56:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 02:56:58,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:56:58,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:56:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:56:58,249 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-06 02:56:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:56:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 57 states and 62 transitions. [2024-12-06 02:56:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-12-06 02:56:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 02:56:58,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:56:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:56:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:56:58,516 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-06 02:56:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:56:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 56 states and 61 transitions. [2024-12-06 02:56:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-12-06 02:56:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 02:56:58,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:56:58,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:56:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:56:58,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-06 02:56:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:56:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 55 states and 60 transitions. [2024-12-06 02:56:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-12-06 02:56:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 02:56:59,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:56:59,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:56:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:56:59,278 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-06 02:56:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:56:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 54 states and 59 transitions. [2024-12-06 02:56:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2024-12-06 02:56:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 02:56:59,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:56:59,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:56:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:56:59,591 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-06 02:56:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:56:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 53 states and 58 transitions. [2024-12-06 02:56:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-12-06 02:56:59,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 02:56:59,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:56:59,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:56:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:56:59,841 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-06 02:57:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 52 states and 57 transitions. [2024-12-06 02:57:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-12-06 02:57:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 02:57:00,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:00,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:00,093 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-06 02:57:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 51 states and 56 transitions. [2024-12-06 02:57:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-12-06 02:57:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 02:57:00,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:00,594 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-06 02:57:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 52 states and 56 transitions. [2024-12-06 02:57:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-12-06 02:57:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 02:57:00,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:00,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:00,844 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-06 02:57:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 55 states and 62 transitions. [2024-12-06 02:57:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-12-06 02:57:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 02:57:01,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:01,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:02,024 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-06 02:57:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 56 states and 64 transitions. [2024-12-06 02:57:02,544 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2024-12-06 02:57:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 02:57:02,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:02,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:02,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-06 02:57:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 57 states and 66 transitions. [2024-12-06 02:57:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-12-06 02:57:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 02:57:02,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:02,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:03,533 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-06 02:57:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 56 states and 63 transitions. [2024-12-06 02:57:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-12-06 02:57:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 02:57:03,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:03,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:03,787 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-06 02:57:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 55 states and 62 transitions. [2024-12-06 02:57:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-12-06 02:57:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 02:57:03,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:03,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:03,835 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-06 02:57:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 57 states and 65 transitions. [2024-12-06 02:57:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2024-12-06 02:57:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 02:57:03,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:03,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:04,062 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-06 02:57:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 59 states and 67 transitions. [2024-12-06 02:57:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-12-06 02:57:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 02:57:05,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:05,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:05,332 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-06 02:57:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 63 states and 74 transitions. [2024-12-06 02:57:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2024-12-06 02:57:06,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 02:57:06,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:06,227 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-06 02:57:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 67 states and 79 transitions. [2024-12-06 02:57:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2024-12-06 02:57:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 02:57:07,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:07,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:07,174 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-06 02:57:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 66 states and 78 transitions. [2024-12-06 02:57:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-12-06 02:57:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 02:57:07,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:07,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:07,215 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-06 02:57:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 68 states and 81 transitions. [2024-12-06 02:57:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2024-12-06 02:57:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 02:57:07,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:07,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:07,256 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-06 02:57:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 69 states and 83 transitions. [2024-12-06 02:57:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2024-12-06 02:57:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 02:57:07,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:07,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:07,300 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-06 02:57:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 72 states and 88 transitions. [2024-12-06 02:57:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2024-12-06 02:57:07,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 02:57:07,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:07,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:07,359 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-06 02:57:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 73 states and 90 transitions. [2024-12-06 02:57:07,379 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2024-12-06 02:57:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 02:57:07,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:07,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:07,412 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-06 02:57:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 75 states and 93 transitions. [2024-12-06 02:57:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2024-12-06 02:57:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 02:57:07,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:07,463 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-06 02:57:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 77 states and 98 transitions. [2024-12-06 02:57:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2024-12-06 02:57:09,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 02:57:09,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:09,709 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-06 02:57:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 85 states and 111 transitions. [2024-12-06 02:57:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2024-12-06 02:57:11,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 02:57:11,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:11,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:57:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 84 states and 110 transitions. [2024-12-06 02:57:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2024-12-06 02:57:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 02:57:11,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:11,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:11,997 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-06 02:57:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 86 states and 114 transitions. [2024-12-06 02:57:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2024-12-06 02:57:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 02:57:12,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:12,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:12,046 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-06 02:57:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 85 states and 113 transitions. [2024-12-06 02:57:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2024-12-06 02:57:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 02:57:12,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:12,092 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-06 02:57:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 86 states and 114 transitions. [2024-12-06 02:57:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2024-12-06 02:57:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 02:57:12,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:12,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:12,151 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-06 02:57:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 85 states and 113 transitions. [2024-12-06 02:57:12,178 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2024-12-06 02:57:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 02:57:12,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:12,209 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-06 02:57:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 86 states and 118 transitions. [2024-12-06 02:57:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-12-06 02:57:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 02:57:12,247 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:12,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:12,267 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-06 02:57:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 85 states and 117 transitions. [2024-12-06 02:57:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-12-06 02:57:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 02:57:12,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:12,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:12,319 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-06 02:57:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 86 states and 120 transitions. [2024-12-06 02:57:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2024-12-06 02:57:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 02:57:12,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:12,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:12,370 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-06 02:57:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 86 states and 119 transitions. [2024-12-06 02:57:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2024-12-06 02:57:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 02:57:12,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:12,431 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-06 02:57:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 88 states and 120 transitions. [2024-12-06 02:57:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-12-06 02:57:12,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 02:57:12,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:12,791 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-06 02:57:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 95 states and 131 transitions. [2024-12-06 02:57:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2024-12-06 02:57:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 02:57:16,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:16,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:57:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 99 states and 136 transitions. [2024-12-06 02:57:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 136 transitions. [2024-12-06 02:57:16,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 02:57:16,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:16,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:16,696 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-06 02:57:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 103 states and 141 transitions. [2024-12-06 02:57:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2024-12-06 02:57:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 02:57:17,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:17,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:17,503 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-06 02:57:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 104 states and 143 transitions. [2024-12-06 02:57:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2024-12-06 02:57:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 02:57:18,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:18,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:18,069 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-06 02:57:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 107 states and 148 transitions. [2024-12-06 02:57:18,841 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2024-12-06 02:57:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 02:57:18,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:18,872 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-06 02:57:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 110 states and 152 transitions. [2024-12-06 02:57:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2024-12-06 02:57:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 02:57:19,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:19,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:19,269 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-06 02:57:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 112 states and 155 transitions. [2024-12-06 02:57:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2024-12-06 02:57:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 02:57:19,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:19,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:57:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 121 states and 169 transitions. [2024-12-06 02:57:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2024-12-06 02:57:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 02:57:26,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:26,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:26,586 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-06 02:57:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 125 states and 173 transitions. [2024-12-06 02:57:27,427 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2024-12-06 02:57:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 02:57:27,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:27,441 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-06 02:57:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 127 states and 175 transitions. [2024-12-06 02:57:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 175 transitions. [2024-12-06 02:57:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 02:57:28,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:28,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:57:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 141 states and 200 transitions. [2024-12-06 02:57:34,357 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 200 transitions. [2024-12-06 02:57:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 02:57:34,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:34,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:57:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 71 states and 95 transitions. [2024-12-06 02:57:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2024-12-06 02:57:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 02:57:42,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:42,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-06 02:57:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 79 states and 107 transitions. [2024-12-06 02:57:47,326 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2024-12-06 02:57:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 02:57:47,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:47,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-06 02:57:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 81 states and 109 transitions. [2024-12-06 02:57:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2024-12-06 02:57:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 02:57:48,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:58:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:58:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 90 states and 126 transitions. [2024-12-06 02:58:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-12-06 02:58:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 02:58:01,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:58:01,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:58:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:58:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 02:58:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:58:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 94 states and 130 transitions. [2024-12-06 02:58:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2024-12-06 02:58:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 02:58:04,080 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:58:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:58:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:58:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:58:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:58:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 105 states and 147 transitions. [2024-12-06 02:58:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-12-06 02:58:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 02:58:22,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:58:22,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:58:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:58:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:58:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:58:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 111 states and 154 transitions. [2024-12-06 02:58:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 154 transitions. [2024-12-06 02:58:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:58:31,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:58:31,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:58:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:58:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:58:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:58:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 114 states and 160 transitions. [2024-12-06 02:58:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-12-06 02:58:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:58:50,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:58:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:58:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:58:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:58:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:58:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 44 states and 49 transitions. [2024-12-06 02:58:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-12-06 02:58:56,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 02:58:56,925 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 59 iterations. [2024-12-06 02:58:56,932 INFO L726 CodeCheckObserver]: All specifications hold 35 specifications checked. All of them hold [2024-12-06 02:59:02,618 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,618 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,619 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,619 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,619 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,619 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,619 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,619 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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~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) (= |ULTIMATE.start_test_fun_~y_ref~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) (<= 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|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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-06 02:59:02,620 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) 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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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) (= .cse0 |ULTIMATE.start_test_fun_#t~mem11#1|) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~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) (= |ULTIMATE.start_test_fun_~y_ref~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) (<= 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|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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-06 02:59:02,620 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,620 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 571 573) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-06 02:59:02,620 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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~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) (= |ULTIMATE.start_test_fun_~y_ref~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) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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-06 02:59:02,620 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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~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) (= |ULTIMATE.start_test_fun_~y_ref~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) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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-06 02:59:02,620 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,620 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,621 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,621 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,621 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,621 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,621 INFO L77 FloydHoareUtils]: At program point L565(line 565) 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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse0) (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) (<= 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) (<= 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|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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-06 02:59:02,621 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,621 INFO L77 FloydHoareUtils]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse1 (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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse0 |ULTIMATE.start_test_fun_#t~mem14#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_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= .cse0 .cse1) (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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 .cse1) (= (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|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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-06 02:59:02,621 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,622 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,622 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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~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) (= |ULTIMATE.start_test_fun_~y_ref~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) (<= 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|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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-06 02:59:02,622 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,622 INFO L77 FloydHoareUtils]: At program point test_fun_returnLabel#1(lines 547 570) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-06 02:59:02,623 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK(lines 571 573) no Hoare annotation was computed. [2024-12-06 02:59:02,623 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 02:59:02,623 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,623 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,623 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,623 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,623 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,624 INFO L77 FloydHoareUtils]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse6 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (= (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|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< .cse6 1) .cse7) (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse1 .cse2 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= .cse6 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse3 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse5 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))))) [2024-12-06 02:59:02,624 INFO L77 FloydHoareUtils]: At program point L562-1(lines 562 564) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (= (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|))) (or (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse1 .cse2 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= .cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse4 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= .cse3 |ULTIMATE.start_test_fun_#t~mem12#1|) .cse5 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse6 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (and .cse0 .cse1 (< |ULTIMATE.start_test_fun_#t~mem12#1| 1) .cse2 .cse4 .cse5 .cse6 .cse7))) [2024-12-06 02:59:02,624 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,624 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,625 INFO L77 FloydHoareUtils]: At program point L558-1(lines 558 568) 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)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse14 (= (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|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= .cse4 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse4) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_test_fun_#t~mem8#1| 0) .cse3 .cse6 .cse7 .cse9 .cse12 .cse14 .cse15) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse4) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2024-12-06 02:59:02,625 INFO L77 FloydHoareUtils]: At program point L558-2(lines 558 568) 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)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse14 (= (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|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= .cse4 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse4) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse4) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2024-12-06 02:59:02,625 INFO L77 FloydHoareUtils]: At program point L554(line 554) 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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~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) (= |ULTIMATE.start_test_fun_~y_ref~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) (<= 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|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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-06 02:59:02,626 INFO L77 FloydHoareUtils]: At program point L558-4(lines 558 568) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.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)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse15 (= (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|)) (.cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= .cse4 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ .cse12 1) .cse4) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (= .cse12 0) .cse2 .cse3 .cse6 .cse7 .cse9 .cse13 .cse15 .cse16) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse4) .cse10 .cse11 .cse13 .cse14 .cse15 .cse16))) [2024-12-06 02:59:02,626 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 02:59:02,626 INFO L77 FloydHoareUtils]: At program point L558-5(lines 558 568) 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-06 02:59:02,626 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,626 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,626 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,627 INFO L77 FloydHoareUtils]: At program point L567(line 567) 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)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse14 (= (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|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= .cse4 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse4) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse4) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2024-12-06 02:59:02,627 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,627 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,627 INFO L77 FloydHoareUtils]: At program point L563(line 563) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_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-06 02:59:02,627 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,627 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,627 INFO L77 FloydHoareUtils]: At program point L559(line 559) 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)) (.cse9 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse4 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~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 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse14 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse15 (= (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|)) (.cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 .cse9) .cse10 (= |ULTIMATE.start_test_fun_#t~mem9#1| .cse11) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_test_fun_#t~mem9#1| 1) .cse9) (not (= .cse9 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 (< .cse11 1) .cse14 .cse15 .cse16))) [2024-12-06 02:59:02,628 INFO L77 FloydHoareUtils]: At program point L559-1(lines 559 566) the Hoare annotation is: (let ((.cse17 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (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 (= .cse17 |ULTIMATE.start_test_fun_#t~mem10#1|)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse13 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse15 (= (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|)) (.cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_#t~mem10#1| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ |ULTIMATE.start_test_fun_#t~mem9#1| 1) |ULTIMATE.start_test_fun_#t~mem10#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse13 1) .cse14 .cse15 .cse16) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse17) .cse10 (= |ULTIMATE.start_test_fun_#t~mem9#1| .cse13) .cse11 .cse12 .cse14 .cse15 .cse16)))) [2024-12-06 02:59:02,628 INFO L77 FloydHoareUtils]: At program point L559-3(lines 559 566) 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)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse14 (= (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|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= .cse4 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse4) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse4) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2024-12-06 02:59:02,628 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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~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) (= |ULTIMATE.start_test_fun_~y_ref~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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (or |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~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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-06 02:59:02,628 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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~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) (= |ULTIMATE.start_test_fun_~y_ref~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_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (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|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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-06 02:59:02,628 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,628 INFO L77 FloydHoareUtils]: At program point L555-5(lines 555 557) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse3 (= (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|))) (or (and |ULTIMATE.start_test_fun_#t~short7#1| .cse0 .cse1 .cse2 .cse3) (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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse0 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse1 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~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|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse2 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse3 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))))) [2024-12-06 02:59:02,629 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 02:59:02,636 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 02:59:02,636 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 02:59:02,637 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 02:59:02,637 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 02:59:02,640 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 02:59:02,640 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 02:59:02,642 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 02:59:02,642 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 02:59:02,642 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 02:59:02,642 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 02:59:02,642 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-12-06 02:59:02,642 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-12-06 02:59:02,642 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-12-06 02:59:02,643 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-12-06 02:59:02,643 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-12-06 02:59:02,643 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!base [2024-12-06 02:59:02,643 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 02:59:02,643 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 02:59:02,643 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 02:59:02,643 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-12-06 02:59:02,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 02:59:02,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 02:59:02,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 02:59:02,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 02:59:02,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 02:59:02,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 02:59:02,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-12-06 02:59:02,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-12-06 02:59:02,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-12-06 02:59:02,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-12-06 02:59:02,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-12-06 02:59:02,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!base [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-12-06 02:59:02,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-12-06 02:59:02,646 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-12-06 02:59:02,646 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 02:59:02,646 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 02:59:02,646 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-12-06 02:59:02,646 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 02:59:02,646 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 02:59:02,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 02:59:02,648 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 02:59:02,648 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-12-06 02:59:02,648 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 02:59:02,648 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 02:59:02,648 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-12-06 02:59:02,648 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-12-06 02:59:02,648 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!base [2024-12-06 02:59:02,648 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 02:59:02,648 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 02:59:02,648 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 02:59:02,648 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-12-06 02:59:02,649 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 02:59:02,649 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 02:59:02,649 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-12-06 02:59:02,649 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-12-06 02:59:02,649 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-12-06 02:59:02,649 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 02:59:02,649 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 02:59:02,650 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 02:59:02,650 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 02:59:02,650 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 02:59:02,650 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 02:59:02,650 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 02:59:02,650 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!base [2024-12-06 02:59:02,650 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 02:59:02,650 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 02:59:02,650 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 02:59:02,650 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 02:59:02,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 02:59:02 ImpRootNode [2024-12-06 02:59:02,652 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 02:59:02,652 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 02:59:02,652 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 02:59:02,652 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 02:59:02,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:56:57" (3/4) ... [2024-12-06 02:59:02,655 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 02:59:02,660 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-12-06 02:59:02,661 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-06 02:59:02,661 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-06 02:59:02,661 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 02:59:02,721 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 02:59:02,721 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 02:59:02,722 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 02:59:02,722 INFO L158 Benchmark]: Toolchain (without parser) took 125973.09ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 116.9MB in the beginning and 384.0MB in the end (delta: -267.2MB). Peak memory consumption was 382.7MB. Max. memory is 16.1GB. [2024-12-06 02:59:02,722 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:59:02,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.44ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 100.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 02:59:02,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.89ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:59:02,723 INFO L158 Benchmark]: Boogie Preprocessor took 17.52ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 98.0MB in the end (delta: 976.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:59:02,723 INFO L158 Benchmark]: RCFGBuilder took 364.47ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 77.6MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 02:59:02,724 INFO L158 Benchmark]: CodeCheck took 125207.40ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 77.4MB in the beginning and 388.1MB in the end (delta: -310.7MB). Peak memory consumption was 332.4MB. Max. memory is 16.1GB. [2024-12-06 02:59:02,724 INFO L158 Benchmark]: Witness Printer took 69.38ms. Allocated memory is still 788.5MB. Free memory was 388.1MB in the beginning and 384.0MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:59:02,726 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, 61 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 119.5s, OverallIterations: 59, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12432 SdHoareTripleChecker+Valid, 37.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11285 mSDsluCounter, 5764 SdHoareTripleChecker+Invalid, 32.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4414 mSDsCounter, 3790 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29859 IncrementalHoareTripleChecker+Invalid, 33649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3790 mSolverCounterUnsat, 1350 mSDtfsCounter, 29859 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7921 GetRequests, 6814 SyntacticMatches, 341 SemanticMatches, 766 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321121 ImplicationChecksByTransitivity, 111.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 891 ConstructedInterpolants, 0 QuantifiedInterpolants, 10485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 51 PerfectInterpolantSequences, 77/129 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: -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: 571]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.44ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 100.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.89ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.52ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 98.0MB in the end (delta: 976.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 364.47ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 77.6MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 125207.40ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 77.4MB in the beginning and 388.1MB in the end (delta: -310.7MB). Peak memory consumption was 332.4MB. Max. memory is 16.1GB. * Witness Printer took 69.38ms. Allocated memory is still 788.5MB. Free memory was 388.1MB in the beginning and 384.0MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - 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: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!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: ~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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - 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: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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: #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: #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: #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!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - 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: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!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: ~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: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - 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~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!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-06 02:59:02,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e79d4d0-ca43-47dd-b259-535dc80fd1cf/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