./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk --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 e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:55:39,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:55:39,929 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-08 22:55:39,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:55:39,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:55:39,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:55:39,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:55:39,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:55:39,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:55:39,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:55:39,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:55:39,969 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 22:55:39,969 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 22:55:39,970 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 22:55:39,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:55:39,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:55:39,972 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 22:55:39,972 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:55:39,973 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:55:39,973 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:55:39,974 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:55:39,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:55:39,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:55:39,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:55:39,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:55:39,977 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:55:39,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:55:39,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524 [2024-11-08 22:55:40,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:55:40,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:55:40,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:55:40,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:55:40,348 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:55:40,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i Unable to find full path for "g++" [2024-11-08 22:55:42,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:55:42,983 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:55:42,984 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2024-11-08 22:55:43,014 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/data/d254ecd4b/5e00058924e142f7bcee5e1be36658e7/FLAGf5e73adaa [2024-11-08 22:55:43,046 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/data/d254ecd4b/5e00058924e142f7bcee5e1be36658e7 [2024-11-08 22:55:43,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:55:43,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:55:43,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:55:43,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:55:43,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:55:43,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e99ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43, skipping insertion in model container [2024-11-08 22:55:43,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:55:43,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:55:43,622 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:55:43,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:55:43,722 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:55:43,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43 WrapperNode [2024-11-08 22:55:43,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:55:43,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:55:43,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:55:43,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:55:43,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,775 INFO L138 Inliner]: procedures = 111, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2024-11-08 22:55:43,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:55:43,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:55:43,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:55:43,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:55:43,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:55:43,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:55:43,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:55:43,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:55:43,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:55:43" (1/1) ... [2024-11-08 22:55:43,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:55:43,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:55:43,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:55:43,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:55:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 22:55:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 22:55:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 22:55:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 22:55:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:55:43,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:55:44,049 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:55:44,055 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:55:44,423 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-08 22:55:44,423 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:55:44,514 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:55:44,515 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:55:44,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:55:44 BoogieIcfgContainer [2024-11-08 22:55:44,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:55:44,516 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:55:44,516 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:55:44,525 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:55:44,525 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:55:44" (1/1) ... [2024-11-08 22:55:44,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:55:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 59 states and 63 transitions. [2024-11-08 22:55:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-11-08 22:55:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 22:55:44,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:44,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:45,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-11-08 22:55:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 58 states and 62 transitions. [2024-11-08 22:55:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-11-08 22:55:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 22:55:45,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:45,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 57 states and 61 transitions. [2024-11-08 22:55:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-11-08 22:55:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 22:55:45,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:45,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 56 states and 60 transitions. [2024-11-08 22:55:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2024-11-08 22:55:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 22:55:45,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 55 states and 59 transitions. [2024-11-08 22:55:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-11-08 22:55:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 22:55:46,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:46,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 54 states and 58 transitions. [2024-11-08 22:55:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-11-08 22:55:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 22:55:46,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 53 states and 57 transitions. [2024-11-08 22:55:47,468 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-11-08 22:55:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 22:55:47,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:47,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 52 states and 56 transitions. [2024-11-08 22:55:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-11-08 22:55:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 22:55:48,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:48,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 51 states and 55 transitions. [2024-11-08 22:55:49,691 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-11-08 22:55:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 22:55:49,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:49,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 52 states and 57 transitions. [2024-11-08 22:55:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-11-08 22:55:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 22:55:50,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:50,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-11-08 22:55:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 53 states and 61 transitions. [2024-11-08 22:55:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-11-08 22:55:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 22:55:51,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 55 states and 67 transitions. [2024-11-08 22:55:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2024-11-08 22:55:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 22:55:52,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 57 states and 72 transitions. [2024-11-08 22:55:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2024-11-08 22:55:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:55:53,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:53,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 61 states and 80 transitions. [2024-11-08 22:55:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-11-08 22:55:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:55:54,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:54,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 65 states and 87 transitions. [2024-11-08 22:55:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2024-11-08 22:55:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 22:55:55,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:55,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 66 states and 88 transitions. [2024-11-08 22:55:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2024-11-08 22:55:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 22:55:55,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:55,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 68 states and 93 transitions. [2024-11-08 22:55:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2024-11-08 22:55:56,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 22:55:56,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:56,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 72 states and 101 transitions. [2024-11-08 22:55:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2024-11-08 22:55:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 22:55:57,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 74 states and 104 transitions. [2024-11-08 22:55:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2024-11-08 22:55:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 22:55:57,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:57,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 76 states and 106 transitions. [2024-11-08 22:55:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2024-11-08 22:55:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 22:55:58,016 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 79 states and 112 transitions. [2024-11-08 22:55:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 112 transitions. [2024-11-08 22:55:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 22:55:58,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:58,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:55:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:55:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 82 states and 117 transitions. [2024-11-08 22:55:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2024-11-08 22:55:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 22:55:59,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:55:59,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:55:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 89 states and 132 transitions. [2024-11-08 22:56:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2024-11-08 22:56:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 22:56:00,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:00,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 91 states and 135 transitions. [2024-11-08 22:56:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2024-11-08 22:56:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 22:56:00,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 91 states and 134 transitions. [2024-11-08 22:56:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 134 transitions. [2024-11-08 22:56:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 22:56:01,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:01,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 98 states and 147 transitions. [2024-11-08 22:56:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 147 transitions. [2024-11-08 22:56:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:56:02,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:02,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 97 states and 146 transitions. [2024-11-08 22:56:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 146 transitions. [2024-11-08 22:56:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:56:02,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:02,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 100 states and 150 transitions. [2024-11-08 22:56:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 150 transitions. [2024-11-08 22:56:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:56:02,980 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 105 states and 161 transitions. [2024-11-08 22:56:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 161 transitions. [2024-11-08 22:56:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:56:04,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:04,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 110 states and 170 transitions. [2024-11-08 22:56:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 170 transitions. [2024-11-08 22:56:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:56:04,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:04,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 118 states and 188 transitions. [2024-11-08 22:56:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 188 transitions. [2024-11-08 22:56:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:56:09,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:09,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 117 states and 187 transitions. [2024-11-08 22:56:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 187 transitions. [2024-11-08 22:56:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:56:09,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:09,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 118 states and 187 transitions. [2024-11-08 22:56:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2024-11-08 22:56:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:56:09,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 120 states and 190 transitions. [2024-11-08 22:56:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 190 transitions. [2024-11-08 22:56:09,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:56:09,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:09,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 122 states and 192 transitions. [2024-11-08 22:56:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 192 transitions. [2024-11-08 22:56:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:56:09,836 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 122 states and 191 transitions. [2024-11-08 22:56:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 191 transitions. [2024-11-08 22:56:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:56:10,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 122 states and 190 transitions. [2024-11-08 22:56:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 190 transitions. [2024-11-08 22:56:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:56:11,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:56:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 124 states and 194 transitions. [2024-11-08 22:56:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 194 transitions. [2024-11-08 22:56:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:56:11,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:56:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 126 states and 197 transitions. [2024-11-08 22:56:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 197 transitions. [2024-11-08 22:56:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:56:11,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 125 states and 195 transitions. [2024-11-08 22:56:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 195 transitions. [2024-11-08 22:56:11,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:56:11,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:11,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 124 states and 193 transitions. [2024-11-08 22:56:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 193 transitions. [2024-11-08 22:56:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:56:12,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:12,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 22:56:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 124 states and 192 transitions. [2024-11-08 22:56:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 192 transitions. [2024-11-08 22:56:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:56:12,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:12,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 22:56:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 127 states and 195 transitions. [2024-11-08 22:56:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 195 transitions. [2024-11-08 22:56:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 22:56:12,462 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:12,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 126 states and 194 transitions. [2024-11-08 22:56:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 194 transitions. [2024-11-08 22:56:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 22:56:12,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:12,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:12,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-11-08 22:56:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 125 states and 193 transitions. [2024-11-08 22:56:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 193 transitions. [2024-11-08 22:56:12,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 22:56:12,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:12,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:56:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 135 states and 219 transitions. [2024-11-08 22:56:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 219 transitions. [2024-11-08 22:56:17,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 22:56:17,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:17,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:56:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 135 states and 218 transitions. [2024-11-08 22:56:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 218 transitions. [2024-11-08 22:56:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 22:56:17,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:17,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:56:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 137 states and 220 transitions. [2024-11-08 22:56:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 220 transitions. [2024-11-08 22:56:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 22:56:17,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:56:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 139 states and 221 transitions. [2024-11-08 22:56:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 221 transitions. [2024-11-08 22:56:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 22:56:17,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:17,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 22:56:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:17,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 137 states and 218 transitions. [2024-11-08 22:56:17,807 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 218 transitions. [2024-11-08 22:56:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 22:56:17,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 22:56:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 139 states and 219 transitions. [2024-11-08 22:56:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 219 transitions. [2024-11-08 22:56:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 22:56:17,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:17,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:56:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 141 states and 221 transitions. [2024-11-08 22:56:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 221 transitions. [2024-11-08 22:56:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 22:56:18,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:18,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:56:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 143 states and 225 transitions. [2024-11-08 22:56:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 225 transitions. [2024-11-08 22:56:18,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 22:56:18,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:18,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:56:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 143 states and 224 transitions. [2024-11-08 22:56:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 224 transitions. [2024-11-08 22:56:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 22:56:19,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:56:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 141 states and 220 transitions. [2024-11-08 22:56:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 220 transitions. [2024-11-08 22:56:19,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:56:19,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 22:56:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 143 states and 223 transitions. [2024-11-08 22:56:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 223 transitions. [2024-11-08 22:56:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:56:20,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 22:56:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 149 states and 230 transitions. [2024-11-08 22:56:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 230 transitions. [2024-11-08 22:56:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:56:21,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:21,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 22:56:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 155 states and 237 transitions. [2024-11-08 22:56:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 237 transitions. [2024-11-08 22:56:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:56:23,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:23,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:56:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 155 states and 236 transitions. [2024-11-08 22:56:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 236 transitions. [2024-11-08 22:56:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:56:23,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:23,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 22:56:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 166 states and 258 transitions. [2024-11-08 22:56:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 258 transitions. [2024-11-08 22:56:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:56:27,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:27,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 22:56:28,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 166 states and 257 transitions. [2024-11-08 22:56:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 257 transitions. [2024-11-08 22:56:28,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:56:28,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 22:56:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 169 states and 260 transitions. [2024-11-08 22:56:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 260 transitions. [2024-11-08 22:56:28,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:56:28,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 22:56:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 172 states and 263 transitions. [2024-11-08 22:56:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 263 transitions. [2024-11-08 22:56:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:56:28,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:28,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 176 states and 270 transitions. [2024-11-08 22:56:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 270 transitions. [2024-11-08 22:56:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:56:35,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:35,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:56:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 180 states and 274 transitions. [2024-11-08 22:56:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 274 transitions. [2024-11-08 22:56:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:56:37,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:37,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:56:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 184 states and 278 transitions. [2024-11-08 22:56:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 278 transitions. [2024-11-08 22:56:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:56:38,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:38,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 22:56:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 184 states and 277 transitions. [2024-11-08 22:56:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 277 transitions. [2024-11-08 22:56:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:56:39,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:39,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 22:56:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 184 states and 276 transitions. [2024-11-08 22:56:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 276 transitions. [2024-11-08 22:56:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:56:40,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:40,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 190 states and 289 transitions. [2024-11-08 22:56:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 289 transitions. [2024-11-08 22:56:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:56:46,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:56:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 193 states and 292 transitions. [2024-11-08 22:56:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 292 transitions. [2024-11-08 22:56:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:56:46,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:46,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:56:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 196 states and 295 transitions. [2024-11-08 22:56:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 295 transitions. [2024-11-08 22:56:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:56:47,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:47,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 203 states and 305 transitions. [2024-11-08 22:56:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 305 transitions. [2024-11-08 22:56:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:56:59,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:59,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:57:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:57:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 210 states and 317 transitions. [2024-11-08 22:57:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 317 transitions. [2024-11-08 22:57:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:57:07,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:57:07,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:57:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:57:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 212 states and 318 transitions. [2024-11-08 22:57:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 318 transitions. [2024-11-08 22:57:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:57:07,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:57:07,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:57:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:57:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 189 states and 284 transitions. [2024-11-08 22:57:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 284 transitions. [2024-11-08 22:57:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:57:07,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:57:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:57:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:57:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 191 states and 285 transitions. [2024-11-08 22:57:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 285 transitions. [2024-11-08 22:57:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:57:07,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:57:07,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:57:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:57:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 168 states and 251 transitions. [2024-11-08 22:57:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2024-11-08 22:57:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 22:57:07,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:57:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:57:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:57:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 173 states and 255 transitions. [2024-11-08 22:57:12,396 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2024-11-08 22:57:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 22:57:12,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:57:12,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 22:57:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:57:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 182 states and 264 transitions. [2024-11-08 22:57:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 264 transitions. [2024-11-08 22:57:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 22:57:24,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:57:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 22:57:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:57:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 186 states and 269 transitions. [2024-11-08 22:57:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 269 transitions. [2024-11-08 22:57:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 22:57:30,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:57:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 22:57:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:57:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 186 states and 262 transitions. [2024-11-08 22:57:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2024-11-08 22:57:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 22:57:35,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:57:35,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 22:57:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:57:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 186 states and 260 transitions. [2024-11-08 22:57:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 260 transitions. [2024-11-08 22:57:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 22:57:38,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:57:38,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:57:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:57:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 182 states and 252 transitions. [2024-11-08 22:57:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 252 transitions. [2024-11-08 22:57:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 22:57:40,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:57:40,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 22:58:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 191 states and 265 transitions. [2024-11-08 22:58:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 265 transitions. [2024-11-08 22:58:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 22:58:05,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:05,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 22:58:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 70 states and 88 transitions. [2024-11-08 22:58:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2024-11-08 22:58:19,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 22:58:19,099 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 85 iterations. [2024-11-08 22:58:19,110 INFO L729 CodeCheckObserver]: All specifications hold 35 specifications checked. All of them hold [2024-11-08 22:58:31,072 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,072 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,072 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,072 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,072 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,072 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,073 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,073 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,073 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 569 571) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-08 22:58:31,073 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,073 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,074 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,074 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,074 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,074 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,074 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,075 INFO L77 FloydHoareUtils]: At program point L561(line 561) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,075 INFO L77 FloydHoareUtils]: At program point L561-1(line 561) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 1) |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_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,076 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,076 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,076 INFO L77 FloydHoareUtils]: At program point L561-2(lines 561 564) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (+ |ULTIMATE.start_test_fun_#t~mem15#1| 1) |ULTIMATE.start_test_fun_#t~mem14#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,077 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,077 INFO L77 FloydHoareUtils]: At program point L561-4(lines 557 566) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,077 INFO L77 FloydHoareUtils]: At program point L557-2(line 557) the Hoare annotation is: (let ((.cse22 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse21 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse2 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse18 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse7 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse8 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse19 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse9 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse10 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse12 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse13 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse14 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse15 (or (not |ULTIMATE.start_test_fun_#t~short10#1|) (< .cse22 .cse21))) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse17 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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|)) (.cse20 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|) .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not .cse19) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20) (and .cse0 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 (or |ULTIMATE.start_test_fun_#t~short10#1| (< .cse21 (+ .cse22 1))))))) [2024-11-08 22:58:31,078 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,078 INFO L77 FloydHoareUtils]: At program point L557-4(line 557) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,079 INFO L77 FloydHoareUtils]: At program point L553-1(line 553) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,079 INFO L77 FloydHoareUtils]: At program point L557-5(line 557) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse8 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse9 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse13 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse14 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse15 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse17 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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|)) (.cse18 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem8#1|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse6 .cse7 .cse8 .cse9 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_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|)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2024-11-08 22:58:31,079 INFO L77 FloydHoareUtils]: At program point L557-7(lines 557 566) the Hoare annotation is: (let ((.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse3 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse5 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse7 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse8 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse9 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse14 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse15 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse18 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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|)) (.cse19 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ .cse12 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 (not |ULTIMATE.start_test_fun_#t~short10#1|) .cse2 .cse4 .cse6 .cse10 .cse11 .cse16 .cse17 .cse18 .cse19))) [2024-11-08 22:58:31,080 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,080 INFO L77 FloydHoareUtils]: At program point L557-9(lines 557 566) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (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~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,080 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK(lines 569 571) no Hoare annotation was computed. [2024-11-08 22:58:31,080 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 22:58:31,080 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,080 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,080 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,080 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,081 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,081 INFO L77 FloydHoareUtils]: At program point L562(line 562) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,082 INFO L77 FloydHoareUtils]: At program point L562-1(line 562) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,082 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,082 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,083 INFO L77 FloydHoareUtils]: At program point L558(line 558) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse8 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse9 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 1)) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse12 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse14 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse15 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse18 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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|)) (.cse19 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2024-11-08 22:58:31,083 INFO L77 FloydHoareUtils]: At program point L558-1(line 558) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse8 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse10 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse9 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 1)) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse12 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse14 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse15 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse18 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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|)) (.cse19 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse9 |ULTIMATE.start_test_fun_#t~mem11#1|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (<= .cse9 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2024-11-08 22:58:31,084 INFO L77 FloydHoareUtils]: At program point L558-2(lines 558 565) the Hoare annotation is: (let ((.cse21 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse8 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse10 (+ .cse21 1)) (.cse9 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse12 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse14 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse15 (= |ULTIMATE.start_test_fun_#t~mem12#1| .cse21)) (.cse16 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse18 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse19 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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|)) (.cse20 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse10 |ULTIMATE.start_test_fun_#t~mem11#1|) .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2024-11-08 22:58:31,084 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,084 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 22:58:31,084 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,085 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,085 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,085 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,085 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,085 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,085 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,086 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,086 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,086 INFO L77 FloydHoareUtils]: At program point L555(line 555) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-11-08 22:58:31,087 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,087 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:58:31,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 22:58:31,096 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:58:31,099 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 22:58:31,100 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 22:58:31,100 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:58:31,100 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:58:31,101 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:58:31,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:58:31,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset [2024-11-08 22:58:31,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 22:58:31,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 22:58:31,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset [2024-11-08 22:58:31,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 22:58:31,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 22:58:31,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 22:58:31,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 22:58:31,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:58:31,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:58:31,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-08 22:58:31,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-08 22:58:31,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 22:58:31,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 22:58:31,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 22:58:31,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 22:58:31,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-08 22:58:31,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 22:58:31,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 22:58:31,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:58:31,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:58:31,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-08 22:58:31,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 22:58:31,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 22:58:31,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 22:58:31,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 22:58:31,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 22:58:31,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 22:58:31,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 22:58:31,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 22:58:31,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 22:58:31,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 22:58:31,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:58:31,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:58:31,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 22:58:31,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 22:58:31,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 22:58:31,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 22:58:31,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 22:58:31,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 22:58:31,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-08 22:58:31,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 22:58:31,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 22:58:31,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 22:58:31,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 22:58:31,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 22:58:31,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 22:58:31,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 22:58:31,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 22:58:31,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:58:31 ImpRootNode [2024-11-08 22:58:31,113 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:58:31,114 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:58:31,114 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:58:31,114 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:58:31,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:55:44" (3/4) ... [2024-11-08 22:58:31,117 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 22:58:31,126 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-08 22:58:31,126 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 22:58:31,127 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 22:58:31,127 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 22:58:31,222 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:58:31,222 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 22:58:31,222 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:58:31,223 INFO L158 Benchmark]: Toolchain (without parser) took 168171.06ms. Allocated memory was 138.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 98.4MB in the beginning and 667.2MB in the end (delta: -568.8MB). Peak memory consumption was 723.8MB. Max. memory is 16.1GB. [2024-11-08 22:58:31,223 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 138.4MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:58:31,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 666.57ms. Allocated memory is still 138.4MB. Free memory was 98.2MB in the beginning and 79.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 22:58:31,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.58ms. Allocated memory is still 138.4MB. Free memory was 79.8MB in the beginning and 77.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:58:31,224 INFO L158 Benchmark]: Boogie Preprocessor took 29.23ms. Allocated memory is still 138.4MB. Free memory was 77.6MB in the beginning and 76.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:58:31,224 INFO L158 Benchmark]: RCFGBuilder took 708.86ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 76.2MB in the beginning and 144.9MB in the end (delta: -68.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-08 22:58:31,224 INFO L158 Benchmark]: CodeCheck took 166597.20ms. Allocated memory was 188.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 144.9MB in the beginning and 672.5MB in the end (delta: -527.6MB). Peak memory consumption was 711.4MB. Max. memory is 16.1GB. [2024-11-08 22:58:31,224 INFO L158 Benchmark]: Witness Printer took 108.51ms. Allocated memory is still 1.4GB. Free memory was 672.5MB in the beginning and 667.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:58:31,228 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, 59 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 154.6s, OverallIterations: 85, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30431 SdHoareTripleChecker+Valid, 132.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29567 mSDsluCounter, 15844 SdHoareTripleChecker+Invalid, 119.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14716 mSDsCounter, 6675 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60966 IncrementalHoareTripleChecker+Invalid, 67641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6675 mSolverCounterUnsat, 1128 mSDtfsCounter, 60966 mSolverCounterSat, 2.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12935 GetRequests, 11753 SyntacticMatches, 482 SemanticMatches, 700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269176 ImplicationChecksByTransitivity, 138.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 1430 NumberOfCodeBlocks, 1430 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 1346 ConstructedInterpolants, 0 QuantifiedInterpolants, 15294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 84 InterpolantComputations, 82 PerfectInterpolantSequences, 252/261 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: -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: 569]: 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.35ms. Allocated memory is still 138.4MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 666.57ms. Allocated memory is still 138.4MB. Free memory was 98.2MB in the beginning and 79.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.58ms. Allocated memory is still 138.4MB. Free memory was 79.8MB in the beginning and 77.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.23ms. Allocated memory is still 138.4MB. Free memory was 77.6MB in the beginning and 76.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 708.86ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 76.2MB in the beginning and 144.9MB in the end (delta: -68.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * CodeCheck took 166597.20ms. Allocated memory was 188.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 144.9MB in the beginning and 672.5MB in the end (delta: -527.6MB). Peak memory consumption was 711.4MB. Max. memory is 16.1GB. * Witness Printer took 108.51ms. Allocated memory is still 1.4GB. Free memory was 672.5MB in the beginning and 667.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset - 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: ~z_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!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: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!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: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!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: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!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-11-08 22:58:31,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_705e5c73-86c3-4d48-956e-b95398ce364d/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE