./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.01-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_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/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_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/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_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/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 c994ac84f704310f86b6de2d86d8b7f67d4998f02f9723cbf53fa381c3e606ea --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:34:33,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:34:33,490 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-08 23:34:33,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:34:33,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:34:33,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:34:33,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:34:33,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:34:33,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:34:33,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:34:33,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:34:33,542 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 23:34:33,542 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 23:34:33,543 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 23:34:33,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:34:33,544 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:34:33,544 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 23:34:33,544 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:34:33,549 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:34:33,549 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:34:33,549 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:34:33,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:34:33,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:34:33,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:34:33,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:34:33,554 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:34:33,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:34:33,554 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_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/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_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/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 -> c994ac84f704310f86b6de2d86d8b7f67d4998f02f9723cbf53fa381c3e606ea [2024-11-08 23:34:33,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:34:33,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:34:33,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:34:33,975 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:34:33,976 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:34:33,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca.i Unable to find full path for "g++" [2024-11-08 23:34:36,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:34:36,301 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:34:36,302 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/sv-benchmarks/c/termination-memory-alloca/a.01-alloca.i [2024-11-08 23:34:36,315 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/bin/ukojak-verify-ImItNfHLgk/data/b9eab0cf2/fac50bfe81214f2c976dd843e35282bc/FLAGd24ff8333 [2024-11-08 23:34:36,339 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/bin/ukojak-verify-ImItNfHLgk/data/b9eab0cf2/fac50bfe81214f2c976dd843e35282bc [2024-11-08 23:34:36,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:34:36,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:34:36,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:34:36,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:34:36,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:34:36,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59480690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36, skipping insertion in model container [2024-11-08 23:34:36,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:34:36,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:34:36,807 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:34:36,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:34:36,898 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:34:36,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36 WrapperNode [2024-11-08 23:34:36,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:34:36,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:34:36,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:34:36,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:34:36,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,938 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-11-08 23:34:36,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:34:36,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:34:36,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:34:36,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:34:36,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:34:36,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:34:36,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:34:36,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:34:36,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:36" (1/1) ... [2024-11-08 23:34:36,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:34:36,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:34:37,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:34:37,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:34:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 23:34:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 23:34:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 23:34:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 23:34:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:34:37,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:34:37,149 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:34:37,151 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:34:37,412 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-08 23:34:37,413 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:34:37,464 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:34:37,464 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 23:34:37,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:34:37 BoogieIcfgContainer [2024-11-08 23:34:37,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:34:37,466 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:34:37,466 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:34:37,476 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:34:37,477 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:34:37" (1/1) ... [2024-11-08 23:34:37,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:34:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 42 states and 45 transitions. [2024-11-08 23:34:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-08 23:34:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 23:34:37,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:37,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 41 states and 44 transitions. [2024-11-08 23:34:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-08 23:34:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 23:34:38,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 40 states and 43 transitions. [2024-11-08 23:34:38,425 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-11-08 23:34:38,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 23:34:38,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 39 states and 42 transitions. [2024-11-08 23:34:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-08 23:34:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 23:34:38,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 38 states and 41 transitions. [2024-11-08 23:34:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-08 23:34:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 23:34:39,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:39,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:39,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 37 states and 40 transitions. [2024-11-08 23:34:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-08 23:34:39,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 23:34:39,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 36 states and 39 transitions. [2024-11-08 23:34:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-08 23:34:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 23:34:40,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:40,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 35 states and 37 transitions. [2024-11-08 23:34:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-11-08 23:34:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 23:34:40,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:40,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 34 states and 36 transitions. [2024-11-08 23:34:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-11-08 23:34:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:34:41,012 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:41,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:41,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 37 states and 41 transitions. [2024-11-08 23:34:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-08 23:34:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:34:41,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 40 states and 46 transitions. [2024-11-08 23:34:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-08 23:34:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:34:41,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:41,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 43 states and 53 transitions. [2024-11-08 23:34:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2024-11-08 23:34:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:34:42,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 46 states and 59 transitions. [2024-11-08 23:34:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2024-11-08 23:34:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:34:43,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:43,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 50 states and 68 transitions. [2024-11-08 23:34:45,465 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-11-08 23:34:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:34:45,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:45,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 49 states and 66 transitions. [2024-11-08 23:34:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2024-11-08 23:34:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:34:45,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:45,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 48 states and 65 transitions. [2024-11-08 23:34:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2024-11-08 23:34:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:34:45,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:45,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 51 states and 72 transitions. [2024-11-08 23:34:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-11-08 23:34:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:34:46,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:46,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 54 states and 78 transitions. [2024-11-08 23:34:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-08 23:34:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:34:46,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:46,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 53 states and 77 transitions. [2024-11-08 23:34:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2024-11-08 23:34:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:34:46,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:46,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 52 states and 76 transitions. [2024-11-08 23:34:46,838 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-11-08 23:34:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:34:46,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:46,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 51 states and 75 transitions. [2024-11-08 23:34:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-11-08 23:34:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:34:46,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:46,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 50 states and 74 transitions. [2024-11-08 23:34:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-11-08 23:34:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:34:47,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:47,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 49 states and 73 transitions. [2024-11-08 23:34:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2024-11-08 23:34:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:34:47,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 48 states and 72 transitions. [2024-11-08 23:34:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2024-11-08 23:34:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:34:47,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:47,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 47 states and 71 transitions. [2024-11-08 23:34:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2024-11-08 23:34:47,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:34:47,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:47,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 46 states and 70 transitions. [2024-11-08 23:34:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2024-11-08 23:34:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:34:47,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:47,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:47,445 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 23:34:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 46 states and 69 transitions. [2024-11-08 23:34:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2024-11-08 23:34:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:34:47,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:47,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:47,518 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 23:34:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 46 states and 68 transitions. [2024-11-08 23:34:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2024-11-08 23:34:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:34:47,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:47,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:47,618 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 23:34:48,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 52 states and 77 transitions. [2024-11-08 23:34:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2024-11-08 23:34:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:34:48,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:48,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:48,205 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 23:34:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 58 states and 84 transitions. [2024-11-08 23:34:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2024-11-08 23:34:48,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:34:48,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:48,548 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 23:34:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 56 states and 79 transitions. [2024-11-08 23:34:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-11-08 23:34:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:34:48,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:48,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:48,618 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 23:34:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 54 states and 74 transitions. [2024-11-08 23:34:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2024-11-08 23:34:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:34:48,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 60 states and 86 transitions. [2024-11-08 23:34:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2024-11-08 23:34:53,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 23:34:53,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:53,236 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 23:34:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 62 states and 87 transitions. [2024-11-08 23:34:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2024-11-08 23:34:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 23:34:53,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:53,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:53,328 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 23:34:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 36 states and 46 transitions. [2024-11-08 23:34:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-08 23:34:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 23:34:53,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:53,580 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 23:34:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 47 states and 60 transitions. [2024-11-08 23:34:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2024-11-08 23:34:57,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 23:34:57,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:35:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:35:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 56 states and 73 transitions. [2024-11-08 23:35:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2024-11-08 23:35:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 23:35:07,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:35:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 23:35:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:35:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 29 states and 36 transitions. [2024-11-08 23:35:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-08 23:35:21,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:35:21,726 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 38 iterations. [2024-11-08 23:35:21,733 INFO L729 CodeCheckObserver]: All specifications hold 25 specifications checked. All of them hold [2024-11-08 23:35:25,317 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,317 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,317 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,317 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,317 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,318 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,318 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,318 INFO L77 FloydHoareUtils]: At program point L560(line 560) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse4 (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_test_fun_#t~mem9#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-11-08 23:35:25,319 INFO L77 FloydHoareUtils]: At program point L556(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= 0 |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) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 23:35:25,319 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 564 566) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-08 23:35:25,319 INFO L77 FloydHoareUtils]: At program point L552(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (<= 0 |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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 23:35:25,319 INFO L77 FloydHoareUtils]: At program point L552-1(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (<= 0 |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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 23:35:25,320 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,320 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,320 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,320 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK(lines 564 566) no Hoare annotation was computed. [2024-11-08 23:35:25,321 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse5 (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse12 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= |ULTIMATE.start_test_fun_#t~mem6#1| 0))) .cse9 .cse10 .cse11 .cse12 .cse13))) [2024-11-08 23:35:25,322 INFO L77 FloydHoareUtils]: At program point L557-1(lines 557 559) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse5 (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse12 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 (not (and (<= 1 |ULTIMATE.start_test_fun_#t~mem7#1|) (= |ULTIMATE.start_test_fun_#t~mem6#1| 0))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2024-11-08 23:35:25,322 INFO L77 FloydHoareUtils]: At program point L557-3(lines 557 559) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= 0 |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) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 23:35:25,323 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= 0 |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) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#length| |ULTIMATE.start_test_fun_~c~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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 23:35:25,323 INFO L77 FloydHoareUtils]: At program point L557-4(lines 557 559) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse4 (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse11 .cse12) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-11-08 23:35:25,323 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 23:35:25,324 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,324 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,324 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,324 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,324 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,325 INFO L77 FloydHoareUtils]: At program point L558(line 558) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= 0 |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) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 23:35:25,325 INFO L77 FloydHoareUtils]: At program point L558-1(line 558) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= 0 |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) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 23:35:25,325 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 23:35:25,325 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,326 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,326 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,326 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,326 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,326 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:35:25,327 INFO L77 FloydHoareUtils]: At program point L555(lines 555 561) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse4 (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_test_fun_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse11 .cse12) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_test_fun_#t~mem5#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-11-08 23:35:25,327 INFO L77 FloydHoareUtils]: At program point L555-2(lines 555 561) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse11 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse3 (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse7 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse8 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse9 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse10 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) .cse0 (not .cse11) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12))) [2024-11-08 23:35:25,327 INFO L77 FloydHoareUtils]: At program point L555-3(lines 555 561) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 23:35:25,337 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 23:35:25,338 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 23:35:25,341 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 23:35:25,342 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 23:35:25,342 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 23:35:25,342 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 23:35:25,343 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-08 23:35:25,343 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 23:35:25,343 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 23:35:25,344 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 23:35:25,344 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 23:35:25,344 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 23:35:25,345 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 23:35:25,345 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 23:35:25,345 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 23:35:25,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:35:25 ImpRootNode [2024-11-08 23:35:25,351 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:35:25,351 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:35:25,352 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:35:25,352 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:35:25,352 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:34:37" (3/4) ... [2024-11-08 23:35:25,356 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:35:25,366 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-08 23:35:25,366 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 23:35:25,366 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 23:35:25,366 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 23:35:25,476 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:35:25,477 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 23:35:25,477 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:35:25,478 INFO L158 Benchmark]: Toolchain (without parser) took 49134.28ms. Allocated memory was 159.4MB in the beginning and 488.6MB in the end (delta: 329.3MB). Free memory was 121.2MB in the beginning and 171.1MB in the end (delta: -49.9MB). Peak memory consumption was 281.3MB. Max. memory is 16.1GB. [2024-11-08 23:35:25,478 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:35:25,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.46ms. Allocated memory is still 159.4MB. Free memory was 120.8MB in the beginning and 102.7MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:35:25,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.94ms. Allocated memory is still 159.4MB. Free memory was 102.7MB in the beginning and 100.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:35:25,482 INFO L158 Benchmark]: Boogie Preprocessor took 30.74ms. Allocated memory is still 159.4MB. Free memory was 100.7MB in the beginning and 99.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:35:25,482 INFO L158 Benchmark]: RCFGBuilder took 493.98ms. Allocated memory is still 159.4MB. Free memory was 99.4MB in the beginning and 127.4MB in the end (delta: -28.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 23:35:25,482 INFO L158 Benchmark]: CodeCheck took 47885.08ms. Allocated memory was 159.4MB in the beginning and 488.6MB in the end (delta: 329.3MB). Free memory was 127.4MB in the beginning and 176.3MB in the end (delta: -49.0MB). Peak memory consumption was 279.2MB. Max. memory is 16.1GB. [2024-11-08 23:35:25,483 INFO L158 Benchmark]: Witness Printer took 125.78ms. Allocated memory is still 488.6MB. Free memory was 176.3MB in the beginning and 171.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:35:25,485 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, 42 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 38, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3742 SdHoareTripleChecker+Valid, 18.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3515 mSDsluCounter, 2614 SdHoareTripleChecker+Invalid, 16.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2234 mSDsCounter, 1595 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8446 IncrementalHoareTripleChecker+Invalid, 10041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1595 mSolverCounterUnsat, 380 mSDtfsCounter, 8446 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3592 GetRequests, 3124 SyntacticMatches, 102 SemanticMatches, 366 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68299 ImplicationChecksByTransitivity, 38.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 418 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 2853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 35 PerfectInterpolantSequences, 69/78 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: 564]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 25 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 553.46ms. Allocated memory is still 159.4MB. Free memory was 120.8MB in the beginning and 102.7MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.94ms. Allocated memory is still 159.4MB. Free memory was 102.7MB in the beginning and 100.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.74ms. Allocated memory is still 159.4MB. Free memory was 100.7MB in the beginning and 99.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 493.98ms. Allocated memory is still 159.4MB. Free memory was 99.4MB in the beginning and 127.4MB in the end (delta: -28.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * CodeCheck took 47885.08ms. Allocated memory was 159.4MB in the beginning and 488.6MB in the end (delta: 329.3MB). Free memory was 127.4MB in the beginning and 176.3MB in the end (delta: -49.0MB). Peak memory consumption was 279.2MB. Max. memory is 16.1GB. * Witness Printer took 125.78ms. Allocated memory is still 488.6MB. Free memory was 176.3MB in the beginning and 171.1MB 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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid RESULT: Ultimate proved your program to be correct! [2024-11-08 23:35:25,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e963b93-6946-4fac-9f0c-cbe53ffdcc37/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