./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b 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_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:01:44,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:01:44,574 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:01:44,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:01:44,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:01:44,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:01:44,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:01:44,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:01:44,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:01:44,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:01:44,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:01:44,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:01:44,607 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:01:44,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:01:44,608 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:01:44,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:01:44,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:01:44,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:01:44,610 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:01:44,611 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:01:44,611 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:01:44,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:01:44,613 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:01:44,613 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:01:44,614 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:01:44,614 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:01:44,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:01:44,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:01:44,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:01:44,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:01:44,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:01:44,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:01:44,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:01:44,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:01:44,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:01:44,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:01:44,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:01:44,620 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:01:44,620 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/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_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2023-11-06 22:01:44,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:01:44,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:01:44,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:01:44,908 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:01:44,908 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:01:44,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2023-11-06 22:01:48,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:01:48,442 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:01:48,443 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2023-11-06 22:01:48,459 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/data/e10764572/1fc3fdbbe82a4482a5da29de9567af7b/FLAG1c1f090fd [2023-11-06 22:01:48,472 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/data/e10764572/1fc3fdbbe82a4482a5da29de9567af7b [2023-11-06 22:01:48,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:01:48,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:01:48,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:01:48,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:01:48,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:01:48,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:48" (1/1) ... [2023-11-06 22:01:48,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1849220e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:48, skipping insertion in model container [2023-11-06 22:01:48,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:48" (1/1) ... [2023-11-06 22:01:48,536 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:01:48,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:01:48,895 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:01:48,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:01:49,017 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:01:49,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49 WrapperNode [2023-11-06 22:01:49,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:01:49,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:01:49,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:01:49,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:01:49,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49" (1/1) ... [2023-11-06 22:01:49,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49" (1/1) ... [2023-11-06 22:01:49,107 INFO L138 Inliner]: procedures = 127, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 158 [2023-11-06 22:01:49,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:01:49,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:01:49,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:01:49,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:01:49,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49" (1/1) ... [2023-11-06 22:01:49,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49" (1/1) ... [2023-11-06 22:01:49,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49" (1/1) ... [2023-11-06 22:01:49,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49" (1/1) ... [2023-11-06 22:01:49,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49" (1/1) ... [2023-11-06 22:01:49,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49" (1/1) ... [2023-11-06 22:01:49,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49" (1/1) ... [2023-11-06 22:01:49,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49" (1/1) ... [2023-11-06 22:01:49,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:01:49,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:01:49,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:01:49,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:01:49,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49" (1/1) ... [2023-11-06 22:01:49,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:01:49,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:49,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:01:49,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:01:49,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:01:49,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:01:49,271 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 22:01:49,271 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 22:01:49,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:01:49,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:01:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:01:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:01:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:01:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:01:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:01:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:01:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:01:49,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:01:49,399 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:01:49,400 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:01:49,878 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:01:49,890 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:01:49,891 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 22:01:49,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:49 BoogieIcfgContainer [2023-11-06 22:01:49,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:01:49,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:01:49,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:01:49,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:01:49,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:01:48" (1/3) ... [2023-11-06 22:01:49,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3552c597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:49, skipping insertion in model container [2023-11-06 22:01:49,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:49" (2/3) ... [2023-11-06 22:01:49,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3552c597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:49, skipping insertion in model container [2023-11-06 22:01:49,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:49" (3/3) ... [2023-11-06 22:01:49,903 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2023-11-06 22:01:49,921 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:01:49,922 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-11-06 22:01:49,968 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:01:49,975 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3f8db0f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:01:49,976 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-11-06 22:01:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 72 states have (on average 2.0833333333333335) internal successors, (150), 136 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:01:49,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:01:49,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:49,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:01:49,989 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:01:49,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash 895918834, now seen corresponding path program 1 times [2023-11-06 22:01:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:50,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966315237] [2023-11-06 22:01:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:50,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:50,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:01:50,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:50,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966315237] [2023-11-06 22:01:50,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966315237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:50,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:50,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:01:50,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589191752] [2023-11-06 22:01:50,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:50,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:01:50,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:50,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:01:50,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:01:50,355 INFO L87 Difference]: Start difference. First operand has 141 states, 72 states have (on average 2.0833333333333335) internal successors, (150), 136 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:01:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:50,561 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2023-11-06 22:01:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:01:50,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 22:01:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:50,578 INFO L225 Difference]: With dead ends: 137 [2023-11-06 22:01:50,578 INFO L226 Difference]: Without dead ends: 134 [2023-11-06 22:01:50,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:01:50,588 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:50,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 211 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:01:50,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-06 22:01:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-11-06 22:01:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 129 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:01:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2023-11-06 22:01:50,658 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 6 [2023-11-06 22:01:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:50,659 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2023-11-06 22:01:50,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:01:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2023-11-06 22:01:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:01:50,660 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:50,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:01:50,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:01:50,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:01:50,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash 895918835, now seen corresponding path program 1 times [2023-11-06 22:01:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:50,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112648962] [2023-11-06 22:01:50,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:01:50,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:50,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112648962] [2023-11-06 22:01:50,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112648962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:50,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:50,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:01:50,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456795987] [2023-11-06 22:01:50,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:50,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:01:50,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:50,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:01:50,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:01:50,816 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:01:51,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:51,014 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2023-11-06 22:01:51,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:01:51,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 22:01:51,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:51,017 INFO L225 Difference]: With dead ends: 131 [2023-11-06 22:01:51,021 INFO L226 Difference]: Without dead ends: 131 [2023-11-06 22:01:51,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:01:51,026 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 5 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:51,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 213 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:01:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-06 22:01:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-11-06 22:01:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 69 states have (on average 1.9420289855072463) internal successors, (134), 126 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:01:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2023-11-06 22:01:51,040 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 6 [2023-11-06 22:01:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:51,041 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2023-11-06 22:01:51,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:01:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2023-11-06 22:01:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:01:51,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:51,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:51,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:01:51,043 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:01:51,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:51,044 INFO L85 PathProgramCache]: Analyzing trace with hash -259128456, now seen corresponding path program 1 times [2023-11-06 22:01:51,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:51,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629676199] [2023-11-06 22:01:51,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:51,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:01:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:01:51,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:51,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629676199] [2023-11-06 22:01:51,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629676199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:51,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:51,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:01:51,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671559580] [2023-11-06 22:01:51,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:51,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:01:51,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:51,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:01:51,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:01:51,287 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:01:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:51,477 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2023-11-06 22:01:51,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:01:51,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-06 22:01:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:51,480 INFO L225 Difference]: With dead ends: 142 [2023-11-06 22:01:51,480 INFO L226 Difference]: Without dead ends: 142 [2023-11-06 22:01:51,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:01:51,482 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 10 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:51,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 316 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:01:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-06 22:01:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2023-11-06 22:01:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 70 states have (on average 1.9285714285714286) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:01:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2023-11-06 22:01:51,495 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 14 [2023-11-06 22:01:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:51,496 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2023-11-06 22:01:51,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:01:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2023-11-06 22:01:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:01:51,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:51,498 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:51,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:01:51,498 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:01:51,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:51,499 INFO L85 PathProgramCache]: Analyzing trace with hash -950837984, now seen corresponding path program 1 times [2023-11-06 22:01:51,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:51,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275665781] [2023-11-06 22:01:51,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:51,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:01:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:01:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:01:51,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:51,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275665781] [2023-11-06 22:01:51,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275665781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:51,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:51,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:01:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730172680] [2023-11-06 22:01:51,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:51,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:01:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:51,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:01:51,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:01:51,738 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:01:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:52,104 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2023-11-06 22:01:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:01:52,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-11-06 22:01:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:52,106 INFO L225 Difference]: With dead ends: 131 [2023-11-06 22:01:52,106 INFO L226 Difference]: Without dead ends: 131 [2023-11-06 22:01:52,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:01:52,108 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:52,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 442 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:01:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-06 22:01:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-11-06 22:01:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.9142857142857144) internal successors, (134), 126 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:01:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2023-11-06 22:01:52,127 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 24 [2023-11-06 22:01:52,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:52,128 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2023-11-06 22:01:52,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:01:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2023-11-06 22:01:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:01:52,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:52,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:52,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:01:52,131 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:01:52,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:52,131 INFO L85 PathProgramCache]: Analyzing trace with hash -950837983, now seen corresponding path program 1 times [2023-11-06 22:01:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:52,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741506572] [2023-11-06 22:01:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:52,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:01:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:52,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:01:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:01:52,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:52,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741506572] [2023-11-06 22:01:52,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741506572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:52,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:52,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:01:52,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156781341] [2023-11-06 22:01:52,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:52,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:01:52,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:52,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:01:52,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:01:52,513 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:01:52,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:52,842 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2023-11-06 22:01:52,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:01:52,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-11-06 22:01:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:52,843 INFO L225 Difference]: With dead ends: 130 [2023-11-06 22:01:52,844 INFO L226 Difference]: Without dead ends: 130 [2023-11-06 22:01:52,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:01:52,845 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 8 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:52,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 466 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:01:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-06 22:01:52,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-11-06 22:01:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 70 states have (on average 1.9) internal successors, (133), 125 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:01:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2023-11-06 22:01:52,858 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 24 [2023-11-06 22:01:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:52,859 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2023-11-06 22:01:52,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:01:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2023-11-06 22:01:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 22:01:52,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:52,860 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:52,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:01:52,861 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:01:52,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1072731137, now seen corresponding path program 1 times [2023-11-06 22:01:52,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:52,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641840192] [2023-11-06 22:01:52,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:52,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:01:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:01:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:01:53,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:53,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641840192] [2023-11-06 22:01:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641840192] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233554629] [2023-11-06 22:01:53,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:53,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:53,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:53,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:53,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:01:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:01:53,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:53,569 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:01:53,649 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 22:01:53,750 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:01:53,751 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-06 22:01:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-06 22:01:53,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:01:53,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233554629] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:53,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:01:53,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-11-06 22:01:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718483683] [2023-11-06 22:01:53,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:01:53,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:01:53,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:01:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-11-06 22:01:53,837 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:01:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:54,406 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2023-11-06 22:01:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:01:54,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-11-06 22:01:54,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:54,409 INFO L225 Difference]: With dead ends: 137 [2023-11-06 22:01:54,409 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 22:01:54,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-11-06 22:01:54,414 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:54,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 549 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 528 Invalid, 0 Unknown, 141 Unchecked, 0.5s Time] [2023-11-06 22:01:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 22:01:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-11-06 22:01:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 74 states have (on average 1.8783783783783783) internal successors, (139), 129 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:01:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2023-11-06 22:01:54,437 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 26 [2023-11-06 22:01:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:54,438 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2023-11-06 22:01:54,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:01:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2023-11-06 22:01:54,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 22:01:54,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:54,440 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:54,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:01:54,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:01:54,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:01:54,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1072731138, now seen corresponding path program 1 times [2023-11-06 22:01:54,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:54,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087000248] [2023-11-06 22:01:54,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:54,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:55,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:01:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:01:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:01:55,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:55,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087000248] [2023-11-06 22:01:55,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087000248] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:55,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384839305] [2023-11-06 22:01:55,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:55,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:55,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:55,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:55,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:01:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:55,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 22:01:55,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:55,392 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:01:55,610 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 22:01:55,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:55,696 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:01:55,705 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:01:55,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:01:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-06 22:01:55,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:01:55,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384839305] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:55,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:01:55,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2023-11-06 22:01:55,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323861682] [2023-11-06 22:01:55,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:01:55,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:01:55,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:55,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:01:55,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=263, Unknown=1, NotChecked=32, Total=342 [2023-11-06 22:01:55,909 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:01:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:56,713 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2023-11-06 22:01:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:01:56,714 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-11-06 22:01:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:56,715 INFO L225 Difference]: With dead ends: 137 [2023-11-06 22:01:56,715 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 22:01:56,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=391, Unknown=1, NotChecked=40, Total=506 [2023-11-06 22:01:56,717 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 13 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:56,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 871 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 893 Invalid, 0 Unknown, 141 Unchecked, 0.7s Time] [2023-11-06 22:01:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 22:01:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-11-06 22:01:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 74 states have (on average 1.864864864864865) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:01:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2023-11-06 22:01:56,723 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 26 [2023-11-06 22:01:56,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:56,724 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2023-11-06 22:01:56,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:01:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2023-11-06 22:01:56,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:01:56,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:56,726 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:56,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:56,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:56,932 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:01:56,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:56,933 INFO L85 PathProgramCache]: Analyzing trace with hash 102625751, now seen corresponding path program 1 times [2023-11-06 22:01:56,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:56,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178834860] [2023-11-06 22:01:56,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:56,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:01:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:01:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:01:57,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:57,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178834860] [2023-11-06 22:01:57,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178834860] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:57,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164341816] [2023-11-06 22:01:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:57,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:57,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:57,140 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:57,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:01:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:01:57,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:01:57,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:01:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:01:57,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164341816] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:01:57,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:01:57,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-06 22:01:57,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265930255] [2023-11-06 22:01:57,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:01:57,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:01:57,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:57,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:01:57,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:01:57,378 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:01:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:57,589 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2023-11-06 22:01:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:01:57,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-11-06 22:01:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:57,593 INFO L225 Difference]: With dead ends: 136 [2023-11-06 22:01:57,593 INFO L226 Difference]: Without dead ends: 136 [2023-11-06 22:01:57,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:01:57,595 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 4 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:57,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 669 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:01:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-06 22:01:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2023-11-06 22:01:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 129 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:01:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2023-11-06 22:01:57,603 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 28 [2023-11-06 22:01:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:57,604 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2023-11-06 22:01:57,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:01:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2023-11-06 22:01:57,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 22:01:57,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:57,608 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:57,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:57,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:57,814 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:01:57,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1118349678, now seen corresponding path program 1 times [2023-11-06 22:01:57,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:57,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938698736] [2023-11-06 22:01:57,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:01:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:01:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:01:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:57,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938698736] [2023-11-06 22:01:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938698736] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:57,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771577823] [2023-11-06 22:01:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:57,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:57,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:57,945 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:57,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:01:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:58,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:01:58,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:01:58,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:01:58,146 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 22:01:58,146 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2023-11-06 22:01:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:01:58,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771577823] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:01:58,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:01:58,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-11-06 22:01:58,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600356710] [2023-11-06 22:01:58,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:01:58,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:01:58,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:58,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:01:58,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:01:58,172 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:01:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:58,430 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2023-11-06 22:01:58,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:01:58,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-06 22:01:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:58,433 INFO L225 Difference]: With dead ends: 140 [2023-11-06 22:01:58,433 INFO L226 Difference]: Without dead ends: 140 [2023-11-06 22:01:58,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:01:58,435 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 9 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:58,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 438 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:01:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-06 22:01:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2023-11-06 22:01:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 77 states have (on average 1.844155844155844) internal successors, (142), 132 states have internal predecessors, (142), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:01:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2023-11-06 22:01:58,440 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 29 [2023-11-06 22:01:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:58,441 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2023-11-06 22:01:58,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:01:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2023-11-06 22:01:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 22:01:58,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:58,442 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:58,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:58,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:58,658 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:01:58,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1118349677, now seen corresponding path program 1 times [2023-11-06 22:01:58,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:58,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741754561] [2023-11-06 22:01:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:58,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:58,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:01:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:58,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:01:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:01:58,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741754561] [2023-11-06 22:01:58,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741754561] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987485593] [2023-11-06 22:01:58,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:58,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:58,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:58,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:58,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:01:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:59,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:01:59,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:01:59,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:01:59,285 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:01:59,285 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-11-06 22:01:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:01:59,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987485593] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:01:59,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:01:59,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-11-06 22:01:59,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762832406] [2023-11-06 22:01:59,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:01:59,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:01:59,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:59,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:01:59,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:01:59,443 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 22:01:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:59,879 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2023-11-06 22:01:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:01:59,880 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-11-06 22:01:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:59,881 INFO L225 Difference]: With dead ends: 144 [2023-11-06 22:01:59,881 INFO L226 Difference]: Without dead ends: 144 [2023-11-06 22:01:59,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:01:59,882 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 19 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:59,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1333 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:01:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-06 22:01:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2023-11-06 22:01:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 77 states have (on average 1.8311688311688312) internal successors, (141), 132 states have internal predecessors, (141), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:01:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2023-11-06 22:01:59,889 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 29 [2023-11-06 22:01:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:59,889 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2023-11-06 22:01:59,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 22:01:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2023-11-06 22:01:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:01:59,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:59,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:59,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:00,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:00,098 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:00,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:00,098 INFO L85 PathProgramCache]: Analyzing trace with hash -309101645, now seen corresponding path program 1 times [2023-11-06 22:02:00,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:00,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100657569] [2023-11-06 22:02:00,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:00,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:02:00,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:00,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100657569] [2023-11-06 22:02:00,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100657569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:00,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:00,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:02:00,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305328391] [2023-11-06 22:02:00,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:00,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:02:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:00,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:02:00,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:02:00,297 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:02:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:00,649 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2023-11-06 22:02:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:02:00,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-06 22:02:00,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:00,651 INFO L225 Difference]: With dead ends: 138 [2023-11-06 22:02:00,651 INFO L226 Difference]: Without dead ends: 138 [2023-11-06 22:02:00,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:02:00,652 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 12 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:00,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 496 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:02:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-06 22:02:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2023-11-06 22:02:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 77 states have (on average 1.8181818181818181) internal successors, (140), 131 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:02:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2023-11-06 22:02:00,657 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 30 [2023-11-06 22:02:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:00,657 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2023-11-06 22:02:00,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:02:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2023-11-06 22:02:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:02:00,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:00,659 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:00,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:02:00,659 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:00,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:00,659 INFO L85 PathProgramCache]: Analyzing trace with hash -309101644, now seen corresponding path program 1 times [2023-11-06 22:02:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:00,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368153504] [2023-11-06 22:02:00,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:00,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:01,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:01,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:02:01,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:01,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368153504] [2023-11-06 22:02:01,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368153504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:01,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:01,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:02:01,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79372729] [2023-11-06 22:02:01,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:01,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:02:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:01,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:02:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:02:01,097 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:02:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:01,426 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2023-11-06 22:02:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:02:01,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-06 22:02:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:01,428 INFO L225 Difference]: With dead ends: 136 [2023-11-06 22:02:01,428 INFO L226 Difference]: Without dead ends: 136 [2023-11-06 22:02:01,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:02:01,429 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 15 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:01,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 575 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:02:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-06 22:02:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-06 22:02:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 130 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:02:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2023-11-06 22:02:01,433 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 30 [2023-11-06 22:02:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:01,434 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2023-11-06 22:02:01,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:02:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2023-11-06 22:02:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:02:01,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:01,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:01,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:02:01,435 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:01,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:01,436 INFO L85 PathProgramCache]: Analyzing trace with hash -610004965, now seen corresponding path program 1 times [2023-11-06 22:02:01,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:01,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979715973] [2023-11-06 22:02:01,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:01,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:01,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:01,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:01,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:02:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:02:01,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:01,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979715973] [2023-11-06 22:02:01,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979715973] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:01,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037050869] [2023-11-06 22:02:01,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:01,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:01,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:01,592 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:01,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:02:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:01,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:02:01,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:02:01,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:01,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037050869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:01,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:01,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-06 22:02:01,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006529329] [2023-11-06 22:02:01,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:01,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:01,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:01,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:01,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:02:01,853 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:01,870 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2023-11-06 22:02:01,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:02:01,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-11-06 22:02:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:01,872 INFO L225 Difference]: With dead ends: 124 [2023-11-06 22:02:01,872 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 22:02:01,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:02:01,873 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:01,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 249 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 22:02:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-06 22:02:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 119 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2023-11-06 22:02:01,879 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 41 [2023-11-06 22:02:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:01,880 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2023-11-06 22:02:01,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2023-11-06 22:02:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:02:01,886 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:01,886 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:01,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:02,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:02:02,092 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:02,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1284381765, now seen corresponding path program 1 times [2023-11-06 22:02:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:02,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682155259] [2023-11-06 22:02:02,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:02,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:02:02,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:02,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682155259] [2023-11-06 22:02:02,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682155259] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:02,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905096865] [2023-11-06 22:02:02,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:02,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:02,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:02,678 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:02,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:02:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 22:02:02,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:02,943 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:02:02,953 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:02:03,039 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:02:03,039 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-06 22:02:03,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-06 22:02:03,121 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-06 22:02:03,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:03,173 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:02:03,264 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:02:03,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:03,326 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:02:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2023-11-06 22:02:03,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:02:03,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905096865] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:03,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:02:03,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2023-11-06 22:02:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733052781] [2023-11-06 22:02:03,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:02:03,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:02:03,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:02:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2023-11-06 22:02:03,413 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:02:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:04,066 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2023-11-06 22:02:04,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:02:04,066 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2023-11-06 22:02:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:04,068 INFO L225 Difference]: With dead ends: 134 [2023-11-06 22:02:04,068 INFO L226 Difference]: Without dead ends: 134 [2023-11-06 22:02:04,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=306, Unknown=1, NotChecked=36, Total=420 [2023-11-06 22:02:04,069 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 359 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:04,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 473 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 638 Invalid, 0 Unknown, 135 Unchecked, 0.6s Time] [2023-11-06 22:02:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-06 22:02:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2023-11-06 22:02:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 70 states have (on average 1.6714285714285715) internal successors, (117), 111 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2023-11-06 22:02:04,074 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 43 [2023-11-06 22:02:04,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:04,074 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2023-11-06 22:02:04,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:02:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2023-11-06 22:02:04,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:02:04,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:04,075 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:04,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:04,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 22:02:04,276 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:04,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1284381764, now seen corresponding path program 1 times [2023-11-06 22:02:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:04,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311848517] [2023-11-06 22:02:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:04,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:05,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:02:05,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:05,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311848517] [2023-11-06 22:02:05,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311848517] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:05,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796168328] [2023-11-06 22:02:05,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:05,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:05,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:05,241 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:05,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:02:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:05,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 22:02:05,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:05,514 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:02:05,542 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:02:05,565 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-06 22:02:05,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:05,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:02:05,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:02:05,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:05,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:02:05,822 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:02:05,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:05,868 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:02:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:02:05,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:05,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796168328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:05,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:05,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2023-11-06 22:02:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081842092] [2023-11-06 22:02:05,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:05,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:02:05,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:05,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:02:05,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2023-11-06 22:02:05,879 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:06,050 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2023-11-06 22:02:06,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:02:06,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2023-11-06 22:02:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:06,052 INFO L225 Difference]: With dead ends: 111 [2023-11-06 22:02:06,052 INFO L226 Difference]: Without dead ends: 111 [2023-11-06 22:02:06,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2023-11-06 22:02:06,053 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 32 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:06,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 257 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 150 Unchecked, 0.1s Time] [2023-11-06 22:02:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-06 22:02:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-06 22:02:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 70 states have (on average 1.6) internal successors, (112), 106 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2023-11-06 22:02:06,057 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 43 [2023-11-06 22:02:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:06,057 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2023-11-06 22:02:06,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2023-11-06 22:02:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:02:06,058 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:06,058 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:06,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:06,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:02:06,270 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:06,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:06,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1635261636, now seen corresponding path program 1 times [2023-11-06 22:02:06,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:06,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190706833] [2023-11-06 22:02:06,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:02:06,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:06,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190706833] [2023-11-06 22:02:06,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190706833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:06,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:06,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:02:06,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944610647] [2023-11-06 22:02:06,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:06,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:02:06,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:06,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:02:06,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:02:06,453 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:02:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:06,695 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2023-11-06 22:02:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:02:06,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-11-06 22:02:06,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:06,697 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:02:06,697 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 22:02:06,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:02:06,698 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 28 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:06,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 348 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:02:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 22:02:06,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-06 22:02:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.542857142857143) internal successors, (108), 102 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2023-11-06 22:02:06,702 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 45 [2023-11-06 22:02:06,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:06,702 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2023-11-06 22:02:06,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:02:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2023-11-06 22:02:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:02:06,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:06,703 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:06,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:02:06,704 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:06,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:06,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1635261635, now seen corresponding path program 1 times [2023-11-06 22:02:06,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:06,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772672005] [2023-11-06 22:02:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:06,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:06,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:02:07,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:07,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772672005] [2023-11-06 22:02:07,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772672005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:07,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:07,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:02:07,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086103055] [2023-11-06 22:02:07,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:07,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:02:07,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:07,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:02:07,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:02:07,073 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:02:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:07,320 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2023-11-06 22:02:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:02:07,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-11-06 22:02:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:07,322 INFO L225 Difference]: With dead ends: 103 [2023-11-06 22:02:07,322 INFO L226 Difference]: Without dead ends: 103 [2023-11-06 22:02:07,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:02:07,323 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 23 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:07,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 360 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:02:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-06 22:02:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-06 22:02:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 98 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2023-11-06 22:02:07,327 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 45 [2023-11-06 22:02:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:07,327 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2023-11-06 22:02:07,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:02:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2023-11-06 22:02:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 22:02:07,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:07,328 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:07,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:02:07,328 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:07,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:07,329 INFO L85 PathProgramCache]: Analyzing trace with hash 846507781, now seen corresponding path program 1 times [2023-11-06 22:02:07,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:07,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055232759] [2023-11-06 22:02:07,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:07,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:07,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:07,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:07,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:08,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:08,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055232759] [2023-11-06 22:02:08,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055232759] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:08,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224325621] [2023-11-06 22:02:08,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:08,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:08,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:08,281 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:08,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:02:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:08,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-06 22:02:08,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:08,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:02:08,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-06 22:02:08,963 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 22:02:09,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:09,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:02:09,028 INFO L322 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-06 22:02:09,028 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-11-06 22:02:09,073 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 22:02:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-11-06 22:02:09,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:02:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224325621] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:09,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:02:09,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2023-11-06 22:02:09,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092272503] [2023-11-06 22:02:09,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:02:09,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 22:02:09,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:09,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 22:02:09,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=524, Unknown=1, NotChecked=46, Total=650 [2023-11-06 22:02:09,204 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:02:10,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:10,089 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2023-11-06 22:02:10,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:02:10,089 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-11-06 22:02:10,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:10,090 INFO L225 Difference]: With dead ends: 120 [2023-11-06 22:02:10,090 INFO L226 Difference]: Without dead ends: 120 [2023-11-06 22:02:10,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=857, Unknown=1, NotChecked=60, Total=1056 [2023-11-06 22:02:10,092 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 134 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:10,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 513 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 751 Invalid, 0 Unknown, 125 Unchecked, 0.7s Time] [2023-11-06 22:02:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-06 22:02:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2023-11-06 22:02:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 97 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2023-11-06 22:02:10,096 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 46 [2023-11-06 22:02:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:10,096 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2023-11-06 22:02:10,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:02:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2023-11-06 22:02:10,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 22:02:10,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:10,097 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:10,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:10,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:02:10,298 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:10,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash 846507782, now seen corresponding path program 1 times [2023-11-06 22:02:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:10,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453309088] [2023-11-06 22:02:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:10,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:11,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:02:12,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:12,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453309088] [2023-11-06 22:02:12,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453309088] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:12,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317205981] [2023-11-06 22:02:12,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:12,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:12,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:12,218 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:12,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:02:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:12,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-06 22:02:12,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:12,578 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:02:13,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-06 22:02:13,052 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:02:13,228 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 22:02:13,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:13,285 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-06 22:02:13,298 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 22:02:13,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 22:02:13,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:13,308 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:02:13,315 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:02:13,385 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 22:02:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-11-06 22:02:13,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:02:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317205981] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:13,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:02:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2023-11-06 22:02:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333712023] [2023-11-06 22:02:13,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:02:13,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-06 22:02:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:13,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-06 22:02:13,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=832, Unknown=1, NotChecked=58, Total=992 [2023-11-06 22:02:13,774 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 29 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:02:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:15,137 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2023-11-06 22:02:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:02:15,138 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-11-06 22:02:15,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:15,139 INFO L225 Difference]: With dead ends: 101 [2023-11-06 22:02:15,139 INFO L226 Difference]: Without dead ends: 101 [2023-11-06 22:02:15,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=168, Invalid=1241, Unknown=1, NotChecked=72, Total=1482 [2023-11-06 22:02:15,141 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 174 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:15,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 685 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1009 Invalid, 0 Unknown, 105 Unchecked, 1.0s Time] [2023-11-06 22:02:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-06 22:02:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-06 22:02:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.457142857142857) internal successors, (102), 96 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2023-11-06 22:02:15,145 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 46 [2023-11-06 22:02:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:15,145 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2023-11-06 22:02:15,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:02:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2023-11-06 22:02:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 22:02:15,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:15,146 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:15,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:15,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:15,347 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:15,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:15,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1745159750, now seen corresponding path program 1 times [2023-11-06 22:02:15,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:15,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468366482] [2023-11-06 22:02:15,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:15,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:16,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:16,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:02:17,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:17,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468366482] [2023-11-06 22:02:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468366482] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:17,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506539634] [2023-11-06 22:02:17,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:17,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:17,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:17,503 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:17,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:02:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:17,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-06 22:02:17,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:17,919 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:02:18,248 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:02:18,448 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:02:18,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 14 [2023-11-06 22:02:18,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:02:18,597 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 22:02:18,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:18,655 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:02:18,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 30 [2023-11-06 22:02:18,693 INFO L322 Elim1Store]: treesize reduction 96, result has 30.9 percent of original size [2023-11-06 22:02:18,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 52 [2023-11-06 22:02:18,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:18,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:02:18,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:02:18,866 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:02:18,866 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 17 [2023-11-06 22:02:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-11-06 22:02:18,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:02:19,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506539634] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:19,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:02:19,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 34 [2023-11-06 22:02:19,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396788145] [2023-11-06 22:02:19,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:02:19,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-06 22:02:19,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:19,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-06 22:02:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1206, Unknown=1, NotChecked=70, Total=1406 [2023-11-06 22:02:19,206 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 35 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:02:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:20,762 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2023-11-06 22:02:20,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:02:20,763 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2023-11-06 22:02:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:20,764 INFO L225 Difference]: With dead ends: 100 [2023-11-06 22:02:20,764 INFO L226 Difference]: Without dead ends: 100 [2023-11-06 22:02:20,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=246, Invalid=2013, Unknown=1, NotChecked=92, Total=2352 [2023-11-06 22:02:20,765 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 139 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:20,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 712 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 969 Invalid, 0 Unknown, 104 Unchecked, 1.0s Time] [2023-11-06 22:02:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-06 22:02:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-06 22:02:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 95 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2023-11-06 22:02:20,770 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 48 [2023-11-06 22:02:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:20,770 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2023-11-06 22:02:20,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:02:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2023-11-06 22:02:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 22:02:20,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:20,771 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:20,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:20,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:20,972 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:20,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1745159751, now seen corresponding path program 1 times [2023-11-06 22:02:20,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:20,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925706794] [2023-11-06 22:02:20,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:20,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:23,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:23,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925706794] [2023-11-06 22:02:23,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925706794] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:23,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181222257] [2023-11-06 22:02:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:23,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:23,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:23,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:23,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 22:02:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:24,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-06 22:02:24,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:24,083 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:02:24,507 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:02:24,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-06 22:02:24,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:02:25,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 22:02:25,069 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 22:02:25,384 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:02:25,385 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 36 [2023-11-06 22:02:25,403 INFO L322 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-06 22:02:25,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2023-11-06 22:02:25,411 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:02:25,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:02:25,560 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 22:02:25,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:25,627 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:02:25,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 78 [2023-11-06 22:02:25,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:25,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:25,641 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-06 22:02:25,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2023-11-06 22:02:25,663 INFO L322 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-11-06 22:02:25,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-11-06 22:02:25,669 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-06 22:02:25,905 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:02:25,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 29 [2023-11-06 22:02:25,919 INFO L322 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-06 22:02:25,919 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2023-11-06 22:02:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-06 22:02:26,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:02:26,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181222257] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:26,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:02:26,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 46 [2023-11-06 22:02:26,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044914111] [2023-11-06 22:02:26,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:02:26,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-06 22:02:26,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:26,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-06 22:02:26,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2386, Unknown=1, NotChecked=98, Total=2652 [2023-11-06 22:02:26,614 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 47 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 40 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:02:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:29,940 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2023-11-06 22:02:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:02:29,941 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 40 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2023-11-06 22:02:29,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:29,941 INFO L225 Difference]: With dead ends: 99 [2023-11-06 22:02:29,941 INFO L226 Difference]: Without dead ends: 99 [2023-11-06 22:02:29,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=357, Invalid=4068, Unknown=1, NotChecked=130, Total=4556 [2023-11-06 22:02:29,944 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 206 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:29,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1297 Invalid, 2092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1976 Invalid, 0 Unknown, 103 Unchecked, 1.8s Time] [2023-11-06 22:02:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-06 22:02:29,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-06 22:02:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2023-11-06 22:02:29,948 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 48 [2023-11-06 22:02:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:29,949 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2023-11-06 22:02:29,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 40 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:02:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2023-11-06 22:02:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-06 22:02:29,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:29,950 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:29,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:30,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:30,157 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:30,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2060039551, now seen corresponding path program 1 times [2023-11-06 22:02:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:30,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578459390] [2023-11-06 22:02:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:30,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:02:30,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:30,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578459390] [2023-11-06 22:02:30,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578459390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:30,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:30,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:02:30,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771078519] [2023-11-06 22:02:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:30,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:02:30,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:30,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:02:30,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:02:30,462 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:30,641 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2023-11-06 22:02:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:02:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2023-11-06 22:02:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:30,642 INFO L225 Difference]: With dead ends: 96 [2023-11-06 22:02:30,642 INFO L226 Difference]: Without dead ends: 96 [2023-11-06 22:02:30,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:02:30,643 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 141 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:30,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 302 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:02:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-06 22:02:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-06 22:02:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 91 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2023-11-06 22:02:30,647 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 49 [2023-11-06 22:02:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:30,647 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2023-11-06 22:02:30,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2023-11-06 22:02:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 22:02:30,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:30,648 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:30,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:02:30,648 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:30,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:30,648 INFO L85 PathProgramCache]: Analyzing trace with hash 281915972, now seen corresponding path program 1 times [2023-11-06 22:02:30,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:30,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44730349] [2023-11-06 22:02:30,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:30,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:02:31,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:31,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44730349] [2023-11-06 22:02:31,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44730349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:31,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:31,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:02:31,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368765157] [2023-11-06 22:02:31,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:31,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:02:31,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:31,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:02:31,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:02:31,039 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:31,421 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2023-11-06 22:02:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:02:31,422 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-11-06 22:02:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:31,423 INFO L225 Difference]: With dead ends: 164 [2023-11-06 22:02:31,423 INFO L226 Difference]: Without dead ends: 164 [2023-11-06 22:02:31,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:02:31,424 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 142 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:31,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 484 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:02:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-06 22:02:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 99. [2023-11-06 22:02:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.364864864864865) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2023-11-06 22:02:31,428 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 51 [2023-11-06 22:02:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:31,429 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2023-11-06 22:02:31,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2023-11-06 22:02:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 22:02:31,430 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:31,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:31,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:02:31,430 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:31,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash 281915973, now seen corresponding path program 1 times [2023-11-06 22:02:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:31,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428772700] [2023-11-06 22:02:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:31,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:31,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:31,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:31,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:02:32,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:32,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428772700] [2023-11-06 22:02:32,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428772700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:32,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:32,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:02:32,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456922097] [2023-11-06 22:02:32,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:32,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:02:32,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:32,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:02:32,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:02:32,029 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:32,393 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2023-11-06 22:02:32,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:02:32,393 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-11-06 22:02:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:32,395 INFO L225 Difference]: With dead ends: 152 [2023-11-06 22:02:32,395 INFO L226 Difference]: Without dead ends: 152 [2023-11-06 22:02:32,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:02:32,396 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 99 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:32,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 440 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:02:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-06 22:02:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 101. [2023-11-06 22:02:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.355263157894737) internal successors, (103), 96 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2023-11-06 22:02:32,402 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 51 [2023-11-06 22:02:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:32,403 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2023-11-06 22:02:32,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2023-11-06 22:02:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 22:02:32,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:32,404 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:32,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:02:32,405 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:32,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:32,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1286460273, now seen corresponding path program 1 times [2023-11-06 22:02:32,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:32,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397734687] [2023-11-06 22:02:32,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:32,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:33,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:33,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:33,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:34,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:34,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397734687] [2023-11-06 22:02:34,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397734687] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:34,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932318158] [2023-11-06 22:02:34,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:34,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:34,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:34,013 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:34,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 22:02:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:34,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 22:02:34,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:34,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:02:34,796 INFO L322 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-06 22:02:34,797 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2023-11-06 22:02:34,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:34,947 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-06 22:02:34,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2023-11-06 22:02:34,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:02:35,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:35,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:02:35,145 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 22:02:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:02:35,170 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:35,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932318158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:35,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:35,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [22] total 32 [2023-11-06 22:02:35,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822053850] [2023-11-06 22:02:35,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:35,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:02:35,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:35,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:02:35,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2023-11-06 22:02:35,173 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:35,807 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-06 22:02:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:02:35,808 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2023-11-06 22:02:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:35,810 INFO L225 Difference]: With dead ends: 100 [2023-11-06 22:02:35,810 INFO L226 Difference]: Without dead ends: 100 [2023-11-06 22:02:35,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=240, Invalid=1566, Unknown=0, NotChecked=0, Total=1806 [2023-11-06 22:02:35,811 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 105 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:35,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 440 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:02:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-06 22:02:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-06 22:02:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-11-06 22:02:35,817 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 54 [2023-11-06 22:02:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:35,818 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-11-06 22:02:35,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-11-06 22:02:35,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 22:02:35,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:35,819 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:35,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-06 22:02:36,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-06 22:02:36,026 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:36,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1286460272, now seen corresponding path program 1 times [2023-11-06 22:02:36,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:36,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402952818] [2023-11-06 22:02:36,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:36,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:02:38,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:38,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402952818] [2023-11-06 22:02:38,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402952818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:38,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324528375] [2023-11-06 22:02:38,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:38,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:38,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:38,828 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:38,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 22:02:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 87 conjunts are in the unsatisfiable core [2023-11-06 22:02:39,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:39,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:02:39,736 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 22:02:39,966 INFO L322 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2023-11-06 22:02:39,966 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2023-11-06 22:02:39,971 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-06 22:02:39,976 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:02:40,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:40,302 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-06 22:02:40,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:40,322 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:02:40,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2023-11-06 22:02:40,333 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 22:02:40,333 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 22:02:40,834 INFO L322 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-11-06 22:02:40,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 102 [2023-11-06 22:02:40,850 INFO L322 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-11-06 22:02:40,851 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 82 [2023-11-06 22:02:40,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:02:40,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:40,988 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:02:40,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 56 [2023-11-06 22:02:40,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:40,997 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2023-11-06 22:02:41,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:41,063 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:02:41,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 56 [2023-11-06 22:02:41,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:41,084 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2023-11-06 22:02:41,228 INFO L322 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2023-11-06 22:02:41,229 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 44 [2023-11-06 22:02:41,234 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-11-06 22:02:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:02:41,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:02:41,401 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4174 (Array Int Int)) (v_ArrVal_4173 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4174) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4173) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (forall ((v_ArrVal_4174 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4174) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) is different from false [2023-11-06 22:02:41,873 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:02:41,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 73 [2023-11-06 22:02:43,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324528375] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:43,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:02:43,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 46 [2023-11-06 22:02:43,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205347310] [2023-11-06 22:02:43,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:02:43,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-06 22:02:43,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:43,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-06 22:02:43,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2668, Unknown=14, NotChecked=104, Total=2970 [2023-11-06 22:02:43,220 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 47 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 40 states have internal predecessors, (95), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-06 22:02:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:46,034 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2023-11-06 22:02:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:02:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 40 states have internal predecessors, (95), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 54 [2023-11-06 22:02:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:46,036 INFO L225 Difference]: With dead ends: 99 [2023-11-06 22:02:46,036 INFO L226 Difference]: Without dead ends: 99 [2023-11-06 22:02:46,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=387, Invalid=4573, Unknown=14, NotChecked=138, Total=5112 [2023-11-06 22:02:46,039 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 193 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:46,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1289 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:02:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-06 22:02:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-06 22:02:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2023-11-06 22:02:46,043 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 54 [2023-11-06 22:02:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:46,044 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2023-11-06 22:02:46,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 40 states have internal predecessors, (95), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-06 22:02:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2023-11-06 22:02:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 22:02:46,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:46,046 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:46,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:46,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-06 22:02:46,253 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:46,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1299874541, now seen corresponding path program 1 times [2023-11-06 22:02:46,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:46,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923399478] [2023-11-06 22:02:46,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:46,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:02:47,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:47,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923399478] [2023-11-06 22:02:47,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923399478] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:47,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620618589] [2023-11-06 22:02:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:47,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:47,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:47,013 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:47,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 22:02:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:47,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-06 22:02:47,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:47,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-06 22:02:47,749 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-06 22:02:47,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:47,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-06 22:02:47,807 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-06 22:02:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-11-06 22:02:47,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:02:47,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620618589] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:47,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:02:47,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-11-06 22:02:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652415385] [2023-11-06 22:02:47,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:02:47,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 22:02:47,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:47,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 22:02:47,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=617, Unknown=2, NotChecked=50, Total=756 [2023-11-06 22:02:47,965 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 26 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 22 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:02:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:48,584 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2023-11-06 22:02:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:02:48,584 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 22 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2023-11-06 22:02:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:48,585 INFO L225 Difference]: With dead ends: 90 [2023-11-06 22:02:48,585 INFO L226 Difference]: Without dead ends: 90 [2023-11-06 22:02:48,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=916, Unknown=2, NotChecked=62, Total=1122 [2023-11-06 22:02:48,587 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 157 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:48,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 878 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 480 Invalid, 0 Unknown, 93 Unchecked, 0.4s Time] [2023-11-06 22:02:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-06 22:02:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-06 22:02:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-11-06 22:02:48,590 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 55 [2023-11-06 22:02:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:48,591 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-11-06 22:02:48,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 22 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:02:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-11-06 22:02:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:02:48,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:48,592 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:48,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:48,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-06 22:02:48,792 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:48,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:48,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1671513138, now seen corresponding path program 1 times [2023-11-06 22:02:48,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:48,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026184717] [2023-11-06 22:02:48,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:48,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:49,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:49,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:02:49,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:49,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026184717] [2023-11-06 22:02:49,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026184717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:49,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:49,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:02:49,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914706167] [2023-11-06 22:02:49,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:49,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:02:49,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:49,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:02:49,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:02:49,465 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 12 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:49,962 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2023-11-06 22:02:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:02:49,963 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2023-11-06 22:02:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:49,964 INFO L225 Difference]: With dead ends: 110 [2023-11-06 22:02:49,964 INFO L226 Difference]: Without dead ends: 110 [2023-11-06 22:02:49,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:02:49,965 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 95 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:49,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 479 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:02:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-06 22:02:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2023-11-06 22:02:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 86 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2023-11-06 22:02:49,968 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 59 [2023-11-06 22:02:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:49,969 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2023-11-06 22:02:49,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2023-11-06 22:02:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:02:49,969 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:49,969 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:49,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 22:02:49,970 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:02:49,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:49,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1671513137, now seen corresponding path program 1 times [2023-11-06 22:02:49,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:49,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513545262] [2023-11-06 22:02:49,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:49,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:52,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:52,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:02:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:52,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:02:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513545262] [2023-11-06 22:02:53,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513545262] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587410944] [2023-11-06 22:02:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:53,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:53,953 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:53,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 22:02:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:54,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 93 conjunts are in the unsatisfiable core [2023-11-06 22:02:54,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:54,414 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:02:55,105 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2023-11-06 22:02:55,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:02:55,115 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:02:55,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:55,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2023-11-06 22:02:55,642 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 22:02:55,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 22:02:55,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-06 22:02:55,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:55,660 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-06 22:02:56,077 INFO L322 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-06 22:02:56,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-06 22:02:56,108 INFO L322 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2023-11-06 22:02:56,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2023-11-06 22:02:56,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:56,402 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-06 22:02:56,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 72 [2023-11-06 22:02:56,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:56,439 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-06 22:02:56,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2023-11-06 22:02:56,509 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:02:56,551 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:02:56,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:02:56,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:56,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2023-11-06 22:02:56,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:56,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-11-06 22:02:57,387 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:02:57,387 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 120 [2023-11-06 22:02:57,420 INFO L322 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2023-11-06 22:02:57,421 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 77 [2023-11-06 22:02:57,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 113 [2023-11-06 22:02:57,931 INFO L322 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2023-11-06 22:02:57,932 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 83 [2023-11-06 22:02:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:02:58,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:03:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587410944] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:03,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:03:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2023-11-06 22:03:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010327948] [2023-11-06 22:03:03,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:03:03,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-06 22:03:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-06 22:03:03,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2808, Unknown=1, NotChecked=0, Total=2970 [2023-11-06 22:03:03,013 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 46 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-06 22:03:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:08,569 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2023-11-06 22:03:08,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:03:08,570 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2023-11-06 22:03:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:08,570 INFO L225 Difference]: With dead ends: 98 [2023-11-06 22:03:08,570 INFO L226 Difference]: Without dead ends: 98 [2023-11-06 22:03:08,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=424, Invalid=5125, Unknown=1, NotChecked=0, Total=5550 [2023-11-06 22:03:08,573 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 330 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:08,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1373 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1792 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-06 22:03:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-06 22:03:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2023-11-06 22:03:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:03:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2023-11-06 22:03:08,577 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 59 [2023-11-06 22:03:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:08,578 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2023-11-06 22:03:08,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-06 22:03:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2023-11-06 22:03:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:03:08,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:08,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:08,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:08,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-06 22:03:08,789 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:03:08,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:08,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1811762787, now seen corresponding path program 1 times [2023-11-06 22:03:08,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:08,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270915798] [2023-11-06 22:03:08,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:12,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:03:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:12,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:03:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:13,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:03:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:03:13,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270915798] [2023-11-06 22:03:13,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270915798] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:13,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573290601] [2023-11-06 22:03:13,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:13,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:13,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:03:13,954 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:03:13,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 22:03:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:14,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 152 conjunts are in the unsatisfiable core [2023-11-06 22:03:14,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:14,471 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:03:14,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:03:14,705 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |c_#valid|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) is different from false [2023-11-06 22:03:14,707 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |c_#valid|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) is different from true [2023-11-06 22:03:14,740 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |c_#valid|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-06 22:03:14,743 WARN L861 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |c_#valid|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-06 22:03:14,795 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0))))))) is different from false [2023-11-06 22:03:14,798 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0))))))) is different from true [2023-11-06 22:03:14,838 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:03:14,841 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2023-11-06 22:03:14,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:03:14,992 WARN L839 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) 8) |c_node_create_#in~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:03:14,995 WARN L861 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) 8) |c_node_create_#in~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2023-11-06 22:03:15,036 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:03:15,039 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2023-11-06 22:03:15,178 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= (+ 1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-06 22:03:15,182 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= (+ 1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-06 22:03:15,279 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-06 22:03:15,284 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-06 22:03:15,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:03:15,551 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:03:15,551 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-06 22:03:15,590 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-06 22:03:15,594 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-06 22:03:15,688 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-06 22:03:15,692 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-06 22:03:15,815 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:03:15,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-11-06 22:03:15,880 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-11-06 22:03:15,909 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:03:15,962 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_29| .cse0)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-06 22:03:15,966 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_29| .cse0)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-06 22:03:16,071 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) (.cse1 (+ |c_#StackHeapBarrier| 1))) (and (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= (+ |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_29| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-06 22:03:16,075 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) (.cse1 (+ |c_#StackHeapBarrier| 1))) (and (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= (+ |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_29| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-06 22:03:16,185 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse0 1)) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int| .cse0) 8) 1) (= .cse4 .cse0))))) is different from false [2023-11-06 22:03:16,193 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse0 1)) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int| .cse0) 8) 1) (= .cse4 .cse0))))) is different from true [2023-11-06 22:03:16,222 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:03:16,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2023-11-06 22:03:16,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:03:16,239 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:03:16,310 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))))) is different from false [2023-11-06 22:03:16,314 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))))) is different from true [2023-11-06 22:03:16,403 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from false [2023-11-06 22:03:16,407 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-11-06 22:03:16,589 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2023-11-06 22:03:16,594 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2023-11-06 22:03:16,848 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| (select |c_#memory_int| |c_node_create_#res#1.base|)) |c_#memory_int|))) is different from false [2023-11-06 22:03:16,853 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| (select |c_#memory_int| |c_node_create_#res#1.base|)) |c_#memory_int|))) is different from true [2023-11-06 22:03:17,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:17,039 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:03:17,039 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 85 [2023-11-06 22:03:17,182 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:03:17,183 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2023-11-06 22:03:17,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:17,208 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:03:17,265 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse0 (+ .cse3 2)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_33| .cse3 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_33| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4)))) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int| .cse3) 8) 1) (= .cse2 .cse3) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse5 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_27| .cse6)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))))))) is different from false [2023-11-06 22:03:17,271 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse0 (+ .cse3 2)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_33| .cse3 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_33| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4)))) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int| .cse3) 8) 1) (= .cse2 .cse3) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse5 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_27| .cse6)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))))))) is different from true [2023-11-06 22:03:17,543 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1))) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse5 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-06 22:03:17,549 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1))) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse5 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-06 22:03:18,160 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1))) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse5 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-06 22:03:18,165 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1))) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse5 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-06 22:03:18,454 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1))) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse5 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-06 22:03:18,459 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1))) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse5 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-06 22:03:18,731 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1))) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse5 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-06 22:03:18,741 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1))) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse5 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-06 22:03:18,957 INFO L322 Elim1Store]: treesize reduction 98, result has 12.5 percent of original size [2023-11-06 22:03:18,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 217 treesize of output 172 [2023-11-06 22:03:19,099 INFO L322 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2023-11-06 22:03:19,100 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 81 [2023-11-06 22:03:19,119 INFO L322 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2023-11-06 22:03:19,120 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2023-11-06 22:03:19,268 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 1))) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse1 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-06 22:03:19,278 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 1))) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse1 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-06 22:03:19,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:19,451 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:03:19,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 103 [2023-11-06 22:03:19,592 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:03:19,592 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 46 [2023-11-06 22:03:19,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:19,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-06 22:03:19,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:19,949 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:03:19,949 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 103 [2023-11-06 22:03:19,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:19,979 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2023-11-06 22:03:20,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:20,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-06 22:03:20,348 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse1 2)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_int| .cse1) 8) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse4 (+ 2 v_arrayElimIndex_18)) (.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_#valid_BEFORE_CALL_33| .cse5)))) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 0) (= |v_#valid_BEFORE_CALL_27| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_27| .cse6)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select (store |v_#valid_BEFORE_CALL_33| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))))))) is different from false [2023-11-06 22:03:20,353 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse1 2)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_int| .cse1) 8) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse4 (+ 2 v_arrayElimIndex_18)) (.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_#valid_BEFORE_CALL_33| .cse5)))) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 0) (= |v_#valid_BEFORE_CALL_27| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_27| .cse6)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select (store |v_#valid_BEFORE_CALL_33| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))))))) is different from true [2023-11-06 22:03:20,899 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (+ .cse2 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (= (select (select |c_#memory_int| .cse2) 8) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse2) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_18)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6)))) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_28| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))))))) is different from false [2023-11-06 22:03:20,904 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (+ .cse2 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (= (select (select |c_#memory_int| .cse2) 8) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse2) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_18)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6)))) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_28| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))))))) is different from true [2023-11-06 22:03:21,122 INFO L322 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-11-06 22:03:21,123 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 139 [2023-11-06 22:03:21,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:21,160 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 52 [2023-11-06 22:03:21,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2023-11-06 22:03:21,419 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-06 22:03:21,523 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse1 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse1) 8) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_156 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_18)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_156) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4)))) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 0) (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_156) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-11-06 22:03:21,529 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse1 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse1) 8) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_156 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_18)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_156) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4)))) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 0) (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_156) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-11-06 22:03:22,013 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 39 [2023-11-06 22:03:22,045 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:03:22,292 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_156 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (v_arrayElimIndex_18 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_18)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_#t~mem16#1.base| 2))) (and (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_#t~mem16#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_156) 0) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select (store |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_#t~mem16#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_#valid_BEFORE_CALL_33| .cse3)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_156) 1) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_32| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|)))) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem16#1.base|) 8) 1)) is different from false [2023-11-06 22:03:22,297 WARN L861 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_156 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (v_arrayElimIndex_18 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_18)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_#t~mem16#1.base| 2))) (and (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_#t~mem16#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_156) 0) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select (store |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_#t~mem16#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_#valid_BEFORE_CALL_33| .cse3)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_156) 1) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_32| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|)))) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem16#1.base|) 8) 1)) is different from true [2023-11-06 22:03:22,562 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_156 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 2 v_arrayElimIndex_18)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_156) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_#valid_BEFORE_CALL_33| .cse3)))) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (= (select (store |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_156) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_32| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= 1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8))) is different from false [2023-11-06 22:03:22,568 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_156 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 2 v_arrayElimIndex_18)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_156) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_#valid_BEFORE_CALL_33| .cse3)))) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (= (select (store |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_156) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_32| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= 1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8))) is different from true [2023-11-06 22:03:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2023-11-06 22:03:22,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:03:23,049 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int)) (v_ArrVal_5254 Int) (v_ArrVal_5250 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5249))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5250)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5248))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5254))) (select (select (store .cse3 .cse1 v_ArrVal_5253) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2023-11-06 22:03:23,081 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5242 (Array Int Int)) (v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int)) (v_ArrVal_5254 Int) (v_ArrVal_5250 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5249))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5243) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5250)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5242) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5248))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5254))) (select (select (store .cse3 .cse1 v_ArrVal_5253) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2023-11-06 22:03:23,095 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5242 (Array Int Int)) (v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int)) (v_ArrVal_5254 Int) (v_ArrVal_5250 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5249))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5243) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5250)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5242) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5248))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5254))) (select (select (store .cse3 .cse1 v_ArrVal_5253) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2023-11-06 22:03:23,110 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5242 (Array Int Int)) (v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int)) (v_ArrVal_5254 Int) (v_ArrVal_5250 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5249))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5243) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5250)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5242) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5248))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5254))) (select (select (store .cse4 .cse1 v_ArrVal_5253) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse2 .cse1 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-11-06 22:03:23,123 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5242 (Array Int Int)) (v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int)) (v_ArrVal_5254 Int) (v_ArrVal_5250 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5249))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5243) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5250)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5242) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5248))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5254))) (select (select (store .cse4 .cse1 v_ArrVal_5253) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse2 .cse1 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-11-06 22:03:23,156 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5242 (Array Int Int)) (v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int)) (v_ArrVal_5254 Int) (v_ArrVal_5250 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5249))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5243) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5250)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5242) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5248))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5254))) (select (select (store .cse4 .cse1 v_ArrVal_5253) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2023-11-06 22:03:23,308 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| Int) (v_ArrVal_5254 Int) (v_ArrVal_5250 (Array Int Int)) (v_ArrVal_5242 (Array Int Int)) (v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5268 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5269 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_5268))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_5269) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5244) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_5249))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5243) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_5250)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5242) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_5248))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5254))) (select (select (store .cse4 .cse1 v_ArrVal_5253) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31|) 0)))) is different from false [2023-11-06 22:03:23,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573290601] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:23,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:03:23,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 68 [2023-11-06 22:03:23,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118484736] [2023-11-06 22:03:23,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:03:23,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-06 22:03:23,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:23,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-06 22:03:23,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1558, Unknown=104, NotChecked=3990, Total=5852 [2023-11-06 22:03:23,315 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 68 states, 64 states have (on average 1.65625) internal successors, (106), 58 states have internal predecessors, (106), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:03:23,930 WARN L839 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |c_#valid|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) is different from false [2023-11-06 22:03:23,932 WARN L861 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |c_#valid|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) is different from true [2023-11-06 22:03:23,936 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |c_#valid|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-06 22:03:23,938 WARN L861 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |c_#valid|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-06 22:03:23,943 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))))) (= |c_old(#length)| |c_#length|)) is different from false [2023-11-06 22:03:23,946 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))))) (= |c_old(#length)| |c_#length|)) is different from true [2023-11-06 22:03:23,951 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:03:23,953 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2023-11-06 22:03:23,958 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|)) is different from false [2023-11-06 22:03:23,961 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|)) is different from true [2023-11-06 22:03:23,966 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2023-11-06 22:03:23,969 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2023-11-06 22:03:23,979 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse7 (store |c_old(#memory_$Pointer$.offset)| .cse3 (select |c_#memory_$Pointer$.offset| .cse3)))) (let ((.cse8 (@diff .cse7 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse7 .cse8 (select |c_#memory_$Pointer$.offset| .cse8)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse3) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse7) (= (select |c_old(#valid)| .cse8) 0)))))))) is different from false [2023-11-06 22:03:23,987 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse7 (store |c_old(#memory_$Pointer$.offset)| .cse3 (select |c_#memory_$Pointer$.offset| .cse3)))) (let ((.cse8 (@diff .cse7 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse7 .cse8 (select |c_#memory_$Pointer$.offset| .cse8)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse3) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse7) (= (select |c_old(#valid)| .cse8) 0)))))))) is different from true [2023-11-06 22:03:24,006 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ 1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= .cse0 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-06 22:03:24,010 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ 1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= .cse0 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-06 22:03:24,024 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= .cse0 1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-06 22:03:24,028 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= .cse0 1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-06 22:03:24,043 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= .cse0 1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2023-11-06 22:03:24,047 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= .cse0 1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2023-11-06 22:03:24,059 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse4 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (or (= .cse3 1) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not .cse4))) is different from false [2023-11-06 22:03:24,063 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse4 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (or (= .cse3 1) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not .cse4))) is different from true [2023-11-06 22:03:24,073 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (and (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (or .cse0 (= .cse1 1)) (not .cse0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| .cse1))) is different from false [2023-11-06 22:03:24,078 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (and (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (or .cse0 (= .cse1 1)) (not .cse0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| .cse1))) is different from true [2023-11-06 22:03:24,091 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (.cse4 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (and (or .cse0 (= .cse1 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_29| .cse2)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (not .cse0) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| .cse1)))) is different from false [2023-11-06 22:03:24,096 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (.cse4 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (and (or .cse0 (= .cse1 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_29| .cse2)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (not .cse0) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| .cse1)))) is different from true [2023-11-06 22:03:24,137 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2)) (.cse3 (+ |c_#StackHeapBarrier| 1))) (and (or (= .cse0 1) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= (+ |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1) |c_#StackHeapBarrier|) (not .cse1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-06 22:03:24,141 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2)) (.cse3 (+ |c_#StackHeapBarrier| 1))) (and (or (= .cse0 1) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= (+ |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1) |c_#StackHeapBarrier|) (not .cse1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-06 22:03:24,158 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 0)) (.cse0 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (+ |c_#StackHeapBarrier| 1)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 8)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= .cse3 .cse0)) (not (= (select |c_#valid| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_29| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1))) (= (select .cse2 0) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int| .cse1) 8) 1) (= .cse7 .cse1)))))) is different from false [2023-11-06 22:03:24,162 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 0)) (.cse0 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (+ |c_#StackHeapBarrier| 1)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 8)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= .cse3 .cse0)) (not (= (select |c_#valid| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_29| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1))) (= (select .cse2 0) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int| .cse1) 8) 1) (= .cse7 .cse1)))))) is different from true [2023-11-06 22:03:24,181 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (= |c_old(#length)| |c_#length|))) is different from false [2023-11-06 22:03:24,185 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (= |c_old(#length)| |c_#length|))) is different from true [2023-11-06 22:03:24,197 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from false [2023-11-06 22:03:24,201 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-11-06 22:03:24,216 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2023-11-06 22:03:24,220 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2023-11-06 22:03:24,251 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2023-11-06 22:03:24,255 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2023-11-06 22:03:24,308 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse10 (store |c_old(#memory_$Pointer$.offset)| .cse5 (select |c_#memory_$Pointer$.offset| .cse5)))) (let ((.cse11 (@diff .cse10 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse10 .cse11 (select |c_#memory_$Pointer$.offset| .cse11)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse3 (+ |c_#StackHeapBarrier| 1)) (.cse6 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse9 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (or (= (select |c_old(#valid)| .cse5) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (= (select .cse6 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))))) (= |c_#valid| (let ((.cse8 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse8 (select |c_#valid| .cse8)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| .cse6) |c_#memory_int|) (= (store |c_old(#memory_int)| .cse9 (select |c_#memory_int| .cse9)) |c_#memory_int|) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse9 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse10) (= (select |c_old(#valid)| .cse11) 0)))))))) is different from false [2023-11-06 22:03:24,320 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse10 (store |c_old(#memory_$Pointer$.offset)| .cse5 (select |c_#memory_$Pointer$.offset| .cse5)))) (let ((.cse11 (@diff .cse10 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse10 .cse11 (select |c_#memory_$Pointer$.offset| .cse11)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse3 (+ |c_#StackHeapBarrier| 1)) (.cse6 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse9 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= (+ v_arrayElimIndex_18 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1))) (or (= (select |c_old(#valid)| .cse5) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (= (select .cse6 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))))) (= |c_#valid| (let ((.cse8 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse8 (select |c_#valid| .cse8)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| .cse6) |c_#memory_int|) (= (store |c_old(#memory_int)| .cse9 (select |c_#memory_int| .cse9)) |c_#memory_int|) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse9 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse10) (= (select |c_old(#valid)| .cse11) 0)))))))) is different from true [2023-11-06 22:03:24,428 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse0 (+ .cse4 2)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_33| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_33| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_#valid_BEFORE_CALL_33| .cse5)))) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int| .cse4) 8) 1) (= .cse3 .cse4) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (not (= .cse1 .cse6)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse7 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_27| .cse8)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6))))) is different from false [2023-11-06 22:03:24,434 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse0 (+ .cse4 2)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_33| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_33| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_#valid_BEFORE_CALL_33| .cse5)))) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int| .cse4) 8) 1) (= .cse3 .cse4) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (not (= .cse1 .cse6)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse7 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_27| .cse8)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6))))) is different from true [2023-11-06 22:03:24,504 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse5 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (not (= .cse8 .cse9)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from false [2023-11-06 22:03:24,510 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse5 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (not (= .cse8 .cse9)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from true [2023-11-06 22:03:24,566 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) 4)) (.cse0 (+ .cse10 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse10) 4)) (.cse3 (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select .cse1 0)) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= .cse2 .cse3)) (not (= .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse4 0) |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse5 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_28| .cse8)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse10 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse11 (select |v_#valid_BEFORE_CALL_33| .cse11)))) (= (select |v_#valid_BEFORE_CALL_33| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse9) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (or (= (select (select |c_#memory_int| .cse10) 8) 1) (= .cse9 .cse10) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from false [2023-11-06 22:03:24,571 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) 4)) (.cse0 (+ .cse10 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse10) 4)) (.cse3 (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select .cse1 0)) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= .cse2 .cse3)) (not (= .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse4 0) |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse5 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_28| .cse8)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse10 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse11 (select |v_#valid_BEFORE_CALL_33| .cse11)))) (= (select |v_#valid_BEFORE_CALL_33| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse9) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (or (= (select (select |c_#memory_int| .cse10) 8) 1) (= .cse9 .cse10) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from true [2023-11-06 22:03:24,647 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse8 2)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse8) 4)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse6 (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| .cse6)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse9 (select |v_#valid_BEFORE_CALL_33| .cse9)))) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (or (= (select (select |c_#memory_int| .cse8) 8) 1) (= .cse7 .cse8) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select .cse10 0)) (+ (select .cse1 0) 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from false [2023-11-06 22:03:24,653 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse8 2)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse8) 4)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse6 (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| .cse6)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse9 (select |v_#valid_BEFORE_CALL_33| .cse9)))) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (or (= (select (select |c_#memory_int| .cse8) 8) 1) (= .cse7 .cse8) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select .cse10 0)) (+ (select .cse1 0) 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from true [2023-11-06 22:03:24,737 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ .cse8 2)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse8) 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse10 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select .cse2 0)) (+ (select .cse1 0) 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse3 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse9 (select |v_#valid_BEFORE_CALL_33| .cse9)))) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (or (= (select (select |c_#memory_int| .cse8) 8) 1) (= .cse7 .cse8) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse10) 8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse10 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from false [2023-11-06 22:03:24,743 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ .cse8 2)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse8) 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse10 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select .cse2 0)) (+ (select .cse1 0) 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse3 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse9 (select |v_#valid_BEFORE_CALL_33| .cse9)))) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (or (= (select (select |c_#memory_int| .cse8) 8) 1) (= .cse7 .cse8) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse10) 8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse10 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from true [2023-11-06 22:03:24,797 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse1 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from false [2023-11-06 22:03:24,802 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse1 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from true [2023-11-06 22:03:24,874 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse1 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from false [2023-11-06 22:03:24,880 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse6 2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (v_arrayElimIndex_18 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimIndex_18))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_33| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7)))) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (or (= (select (select |c_#memory_int| .cse6) 8) 1) (= .cse1 .cse6) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from true [2023-11-06 22:03:24,952 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ .cse1 2)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_int| .cse1) 8) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_18)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6)))) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 0) (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_28| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_33| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from false [2023-11-06 22:03:24,957 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ .cse1 2)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_int| .cse1) 8) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_18)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6)))) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 0) (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_28| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_33| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from true [2023-11-06 22:03:25,046 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse5 0)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0)) (.cse0 (+ .cse2 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (= (select (select |c_#memory_int| .cse2) 8) 1) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse2) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse7 (+ 2 v_arrayElimIndex_18)) (.cse6 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8)))) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= |v_#valid_BEFORE_CALL_27| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse9 (select |v_#valid_BEFORE_CALL_27| .cse9)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse10 (select |v_#valid_BEFORE_CALL_28| .cse10)))) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))))))) is different from false [2023-11-06 22:03:25,053 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse5 0)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0)) (.cse0 (+ .cse2 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (= (select (select |c_#memory_int| .cse2) 8) 1) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse2) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse7 (+ 2 v_arrayElimIndex_18)) (.cse6 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8)))) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= |v_#valid_BEFORE_CALL_27| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse9 (select |v_#valid_BEFORE_CALL_27| .cse9)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse10 (select |v_#valid_BEFORE_CALL_28| .cse10)))) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))))))) is different from true [2023-11-06 22:03:25,115 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse2 0))) (let ((.cse0 (+ .cse1 2)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse1) 8) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_156 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_18)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_156) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6)))) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 0) (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_28| .cse8)))) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_156) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= (select .cse3 0) 0))))) is different from false [2023-11-06 22:03:25,120 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse2 0))) (let ((.cse0 (+ .cse1 2)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse1) 8) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_156 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_18)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_156) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6)))) (= (select |v_#valid_BEFORE_CALL_33| .cse1) 0) (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_28| .cse8)))) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_156) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= (select .cse3 0) 0))))) is different from true [2023-11-06 22:03:25,219 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem16#1.base|))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_156 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (v_arrayElimIndex_18 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_18)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_#t~mem16#1.base| 2))) (and (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_#t~mem16#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_156) 0) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select (store |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_#t~mem16#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_#valid_BEFORE_CALL_33| .cse3)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_156) 1) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_32| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|)))) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse6 8) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (+ |c_ULTIMATE.start_main_#t~mem16#1.offset| 8))))) is different from false [2023-11-06 22:03:25,225 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem16#1.base|))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_156 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (v_arrayElimIndex_18 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_18)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_#t~mem16#1.base| 2))) (and (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_#t~mem16#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_156) 0) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (= (select (store |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_#t~mem16#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_#valid_BEFORE_CALL_33| .cse3)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_28| .cse5)))) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_156) 1) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_32| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|)))) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse6 8) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (+ |c_ULTIMATE.start_main_#t~mem16#1.offset| 8))))) is different from true [2023-11-06 22:03:25,300 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_156 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_18)) (.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_156) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select (store |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_156) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_32| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= 1 (select .cse0 8)))) is different from false [2023-11-06 22:03:25,306 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11| Int) (v_arrayElimCell_156 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_133 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (v_arrayElimIndex_18 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_18)) (.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_156) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_26| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimCell_133) 0) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_18) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= |v_#valid_BEFORE_CALL_33| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_33|))) (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_26| |v_#valid_BEFORE_CALL_27|))) (store |v_#valid_BEFORE_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select (store |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimCell_156) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_11|) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_32| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_133) 1)))) (= 1 (select .cse0 8)))) is different from true [2023-11-06 22:03:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:25,579 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2023-11-06 22:03:25,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-06 22:03:25,580 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 64 states have (on average 1.65625) internal successors, (106), 58 states have internal predecessors, (106), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2023-11-06 22:03:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:25,581 INFO L225 Difference]: With dead ends: 109 [2023-11-06 22:03:25,581 INFO L226 Difference]: Without dead ends: 109 [2023-11-06 22:03:25,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 67 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=302, Invalid=1868, Unknown=168, NotChecked=10318, Total=12656 [2023-11-06 22:03:25,585 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 13 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 5447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4883 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:25,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 983 Invalid, 5447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 562 Invalid, 0 Unknown, 4883 Unchecked, 0.5s Time] [2023-11-06 22:03:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-06 22:03:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-06 22:03:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 102 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:03:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2023-11-06 22:03:25,590 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 63 [2023-11-06 22:03:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:25,590 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2023-11-06 22:03:25,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 64 states have (on average 1.65625) internal successors, (106), 58 states have internal predecessors, (106), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:03:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2023-11-06 22:03:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:03:25,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:25,591 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:25,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:25,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:25,799 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:03:25,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash -330565855, now seen corresponding path program 1 times [2023-11-06 22:03:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:25,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105597131] [2023-11-06 22:03:25,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:25,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:25,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:03:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:25,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:03:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:25,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:03:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:03:25,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:25,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105597131] [2023-11-06 22:03:25,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105597131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:25,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:25,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:03:25,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372911885] [2023-11-06 22:03:25,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:25,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:03:25,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:25,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:03:25,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:03:25,998 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:03:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:26,207 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2023-11-06 22:03:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:03:26,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2023-11-06 22:03:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:26,209 INFO L225 Difference]: With dead ends: 127 [2023-11-06 22:03:26,209 INFO L226 Difference]: Without dead ends: 127 [2023-11-06 22:03:26,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:03:26,210 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 49 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:26,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 362 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:03:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-06 22:03:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2023-11-06 22:03:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:03:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2023-11-06 22:03:26,213 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 64 [2023-11-06 22:03:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:26,214 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2023-11-06 22:03:26,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:03:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2023-11-06 22:03:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:03:26,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:26,215 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:26,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-06 22:03:26,215 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:03:26,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash -330565854, now seen corresponding path program 1 times [2023-11-06 22:03:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307364399] [2023-11-06 22:03:26,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:26,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:26,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:03:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:26,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:03:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:26,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:03:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:03:26,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:26,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307364399] [2023-11-06 22:03:26,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307364399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:26,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:26,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:03:26,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755698525] [2023-11-06 22:03:26,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:26,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:03:26,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:26,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:03:26,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:03:26,547 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:03:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:26,757 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2023-11-06 22:03:26,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:03:26,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2023-11-06 22:03:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:26,758 INFO L225 Difference]: With dead ends: 108 [2023-11-06 22:03:26,758 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 22:03:26,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:03:26,759 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 50 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:26,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 322 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:03:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 22:03:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2023-11-06 22:03:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.25) internal successors, (105), 100 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:03:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2023-11-06 22:03:26,762 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 64 [2023-11-06 22:03:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:26,763 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2023-11-06 22:03:26,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:03:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2023-11-06 22:03:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:03:26,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:26,764 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:26,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 22:03:26,764 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:03:26,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:26,764 INFO L85 PathProgramCache]: Analyzing trace with hash 153796039, now seen corresponding path program 1 times [2023-11-06 22:03:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:26,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421010581] [2023-11-06 22:03:26,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:26,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:32,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:03:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:32,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:03:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:32,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:03:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:03:34,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:34,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421010581] [2023-11-06 22:03:34,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421010581] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:34,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559505489] [2023-11-06 22:03:34,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:34,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:34,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:03:34,225 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:03:34,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-06 22:03:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:34,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-06 22:03:34,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:35,091 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:03:35,675 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:03:36,071 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:03:36,071 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 19 [2023-11-06 22:03:36,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:03:36,079 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:03:36,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:36,583 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:03:36,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:36,601 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:03:36,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 37 [2023-11-06 22:03:36,625 INFO L322 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-06 22:03:36,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-11-06 22:03:37,644 INFO L322 Elim1Store]: treesize reduction 94, result has 16.1 percent of original size [2023-11-06 22:03:37,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 112 treesize of output 105 [2023-11-06 22:03:37,669 INFO L322 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-11-06 22:03:37,669 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 56 [2023-11-06 22:03:37,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-06 22:03:37,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:37,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-11-06 22:03:37,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:37,858 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:03:37,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:37,907 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-11-06 22:03:37,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:37,919 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:03:38,115 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 66 [2023-11-06 22:03:38,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:38,128 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:03:38,541 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:03:38,709 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:03:38,710 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 31 [2023-11-06 22:03:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:03:38,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:03:39,622 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5906 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5906) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 1)) is different from false [2023-11-06 22:03:39,650 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5906 (Array Int Int)) (v_ArrVal_5905 (Array Int Int)) (v_ArrVal_5904 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5905))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5904)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse3 .cse2 v_ArrVal_5906) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 1)) is different from false [2023-11-06 22:03:39,675 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5906 (Array Int Int)) (v_ArrVal_5901 (Array Int Int)) (v_ArrVal_5900 (Array Int Int)) (v_ArrVal_5905 (Array Int Int)) (v_ArrVal_5904 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5901) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5905))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5900) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5904)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse3 .cse2 v_ArrVal_5906) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 1)) is different from false [2023-11-06 22:03:39,692 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5906 (Array Int Int)) (v_ArrVal_5901 (Array Int Int)) (v_ArrVal_5900 (Array Int Int)) (v_ArrVal_5905 (Array Int Int)) (v_ArrVal_5904 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5901) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5905))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5900) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5904)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse3 .cse2 v_ArrVal_5906) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 1)) is different from false [2023-11-06 22:03:39,718 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5906 (Array Int Int)) (v_ArrVal_5901 (Array Int Int)) (v_ArrVal_5900 (Array Int Int)) (v_ArrVal_5905 (Array Int Int)) (v_ArrVal_5904 (Array Int Int))) (= (select |c_#valid| (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5901) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5905))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5900) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5904)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ 4 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse3 .cse2 v_ArrVal_5906) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) 1)) is different from false [2023-11-06 22:03:40,429 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5906 (Array Int Int)) (v_ArrVal_5901 (Array Int Int)) (v_ArrVal_5900 (Array Int Int)) (v_ArrVal_5905 (Array Int Int)) (v_ArrVal_5904 (Array Int Int))) (= (select |c_#valid| (let ((.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5901) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5905))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5900) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5904)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse3 .cse2 v_ArrVal_5906) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) 1)) is different from false [2023-11-06 22:03:40,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559505489] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:40,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:03:40,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 30] total 67 [2023-11-06 22:03:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276943350] [2023-11-06 22:03:40,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:03:40,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-06 22:03:40,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:40,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-06 22:03:40,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=5235, Unknown=98, NotChecked=906, Total=6480 [2023-11-06 22:03:40,876 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 68 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 60 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:03:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:55,346 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2023-11-06 22:03:55,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-06 22:03:55,347 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 60 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2023-11-06 22:03:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:55,348 INFO L225 Difference]: With dead ends: 130 [2023-11-06 22:03:55,348 INFO L226 Difference]: Without dead ends: 130 [2023-11-06 22:03:55,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2399 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=757, Invalid=10697, Unknown=126, NotChecked=1302, Total=12882 [2023-11-06 22:03:55,350 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 423 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 3038 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 3101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:55,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1221 Invalid, 3101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3038 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-06 22:03:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-06 22:03:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2023-11-06 22:03:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.247191011235955) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:03:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2023-11-06 22:03:55,354 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 66 [2023-11-06 22:03:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:55,354 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2023-11-06 22:03:55,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 60 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:03:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2023-11-06 22:03:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:03:55,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:55,356 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:55,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:55,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:55,565 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:03:55,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:55,566 INFO L85 PathProgramCache]: Analyzing trace with hash 153796040, now seen corresponding path program 1 times [2023-11-06 22:03:55,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:55,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087403617] [2023-11-06 22:03:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:55,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:01,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:04:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:04:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:04:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:04:02,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:02,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087403617] [2023-11-06 22:04:02,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087403617] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:04:02,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533307245] [2023-11-06 22:04:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:02,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:02,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:02,668 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:04:02,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-06 22:04:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:03,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-06 22:04:03,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:04:03,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-06 22:04:04,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:04,300 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:04:04,668 INFO L322 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-06 22:04:04,668 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2023-11-06 22:04:04,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:04,879 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-06 22:04:04,879 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 34 [2023-11-06 22:04:04,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:04:04,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:04,981 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:04:05,169 INFO L322 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2023-11-06 22:04:05,170 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 121 [2023-11-06 22:04:05,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:05,179 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 89 [2023-11-06 22:04:05,742 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:04:05,743 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 60 [2023-11-06 22:04:05,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:05,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 19 [2023-11-06 22:04:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:04:05,927 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:04:05,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533307245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:04:05,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:04:05,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [38] total 60 [2023-11-06 22:04:05,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553152519] [2023-11-06 22:04:05,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:04:05,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 22:04:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:05,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 22:04:05,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3484, Unknown=0, NotChecked=0, Total=3660 [2023-11-06 22:04:05,929 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 24 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:04:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:04:08,313 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2023-11-06 22:04:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 22:04:08,314 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2023-11-06 22:04:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:04:08,315 INFO L225 Difference]: With dead ends: 114 [2023-11-06 22:04:08,315 INFO L226 Difference]: Without dead ends: 114 [2023-11-06 22:04:08,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=292, Invalid=5560, Unknown=0, NotChecked=0, Total=5852 [2023-11-06 22:04:08,316 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 227 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:04:08,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 683 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:04:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-06 22:04:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2023-11-06 22:04:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 103 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:04:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2023-11-06 22:04:08,321 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 66 [2023-11-06 22:04:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:04:08,321 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2023-11-06 22:04:08,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:04:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2023-11-06 22:04:08,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:04:08,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:08,323 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:08,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-06 22:04:08,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-06 22:04:08,530 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:04:08,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:08,531 INFO L85 PathProgramCache]: Analyzing trace with hash 153796075, now seen corresponding path program 1 times [2023-11-06 22:04:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:08,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122542098] [2023-11-06 22:04:08,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:08,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:14,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:04:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:15,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:04:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:15,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:04:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:04:16,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:16,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122542098] [2023-11-06 22:04:16,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122542098] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:04:16,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959700491] [2023-11-06 22:04:16,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:16,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:16,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:16,388 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:04:16,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-06 22:04:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:16,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 175 conjunts are in the unsatisfiable core [2023-11-06 22:04:16,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:04:16,909 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:04:16,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:04:17,372 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:04:17,373 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-06 22:04:17,682 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:04:18,116 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:04:18,116 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-06 22:04:18,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:18,167 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:04:18,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-11-06 22:04:18,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:04:18,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:04:18,812 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:04:18,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 63 [2023-11-06 22:04:18,820 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:04:19,278 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:04:19,279 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 37 [2023-11-06 22:04:19,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:19,324 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:04:19,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2023-11-06 22:04:19,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:04:20,025 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:04:20,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 49 [2023-11-06 22:04:20,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:20,035 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 22:04:20,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:20,052 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 22:04:20,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:20,719 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:04:20,720 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 83 [2023-11-06 22:04:20,753 INFO L322 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-11-06 22:04:20,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2023-11-06 22:04:20,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:20,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:20,791 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:04:20,791 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-11-06 22:04:20,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:20,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:20,837 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:04:20,837 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-06 22:04:22,326 INFO L322 Elim1Store]: treesize reduction 98, result has 12.5 percent of original size [2023-11-06 22:04:22,327 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 184 treesize of output 139 [2023-11-06 22:04:22,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:22,377 INFO L322 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2023-11-06 22:04:22,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 64 [2023-11-06 22:04:22,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:22,442 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:04:22,442 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 81 [2023-11-06 22:04:22,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:22,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:22,461 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2023-11-06 22:04:22,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:22,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:22,583 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2023-11-06 22:04:22,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:22,606 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:04:22,606 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 81 [2023-11-06 22:04:22,981 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:04:22,982 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 187 treesize of output 100 [2023-11-06 22:04:22,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:22,998 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2023-11-06 22:04:24,376 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:04:24,376 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 55 [2023-11-06 22:04:24,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:24,590 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 22:04:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:04:24,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:04:33,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959700491] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:04:33,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:04:33,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2023-11-06 22:04:33,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949840732] [2023-11-06 22:04:33,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:04:33,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-06 22:04:33,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:33,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-06 22:04:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=6845, Unknown=14, NotChecked=0, Total=7140 [2023-11-06 22:04:33,690 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 71 states, 66 states have (on average 1.696969696969697) internal successors, (112), 61 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:04:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:04:46,732 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2023-11-06 22:04:46,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-06 22:04:46,733 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 66 states have (on average 1.696969696969697) internal successors, (112), 61 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2023-11-06 22:04:46,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:04:46,735 INFO L225 Difference]: With dead ends: 183 [2023-11-06 22:04:46,735 INFO L226 Difference]: Without dead ends: 183 [2023-11-06 22:04:46,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3043 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=735, Invalid=12133, Unknown=14, NotChecked=0, Total=12882 [2023-11-06 22:04:46,737 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 647 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 2817 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:04:46,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1357 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2817 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-06 22:04:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-06 22:04:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 112. [2023-11-06 22:04:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 105 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:04:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2023-11-06 22:04:46,742 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 66 [2023-11-06 22:04:46,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:04:46,743 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2023-11-06 22:04:46,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 66 states have (on average 1.696969696969697) internal successors, (112), 61 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:04:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2023-11-06 22:04:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-06 22:04:46,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:46,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:46,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-06 22:04:46,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:46,953 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:04:46,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:46,953 INFO L85 PathProgramCache]: Analyzing trace with hash -693676773, now seen corresponding path program 1 times [2023-11-06 22:04:46,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:46,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005251642] [2023-11-06 22:04:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:46,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:04:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:51,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:04:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:51,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:04:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:04:52,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:52,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005251642] [2023-11-06 22:04:52,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005251642] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:04:52,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166646332] [2023-11-06 22:04:52,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:52,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:52,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:52,138 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:04:52,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-06 22:04:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:52,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 134 conjunts are in the unsatisfiable core [2023-11-06 22:04:52,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:04:52,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:04:53,225 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:04:53,620 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:04:53,620 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-06 22:04:53,986 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:04:54,242 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:04:54,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-06 22:04:54,678 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:04:54,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 31 [2023-11-06 22:04:54,720 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2023-11-06 22:04:55,348 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:04:55,348 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 31 [2023-11-06 22:04:55,353 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:04:55,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:04:55,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:55,966 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:04:55,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:55,992 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:04:55,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 59 [2023-11-06 22:04:56,023 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:04:56,023 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-06 22:04:57,381 INFO L322 Elim1Store]: treesize reduction 98, result has 12.5 percent of original size [2023-11-06 22:04:57,381 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 150 treesize of output 115 [2023-11-06 22:04:57,405 INFO L322 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-06 22:04:57,405 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 45 [2023-11-06 22:04:57,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:57,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:04:57,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:57,477 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:04:57,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 57 [2023-11-06 22:04:57,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:57,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:04:57,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:57,599 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:04:57,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 57 [2023-11-06 22:04:57,959 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:04:57,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 79 [2023-11-06 22:04:57,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:57,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:04:59,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:04:59,457 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:04:59,458 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 37 [2023-11-06 22:04:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:04:59,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:05:00,626 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6830 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6830) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4))))))) is different from false [2023-11-06 22:05:00,646 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6830 (Array Int Int)) (v_ArrVal_6829 (Array Int Int)) (v_ArrVal_6828 (Array Int Int))) (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6828))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6829))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6830) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))))) is different from false [2023-11-06 22:05:00,671 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6830 (Array Int Int)) (v_ArrVal_6825 (Array Int Int)) (v_ArrVal_6824 (Array Int Int)) (v_ArrVal_6829 (Array Int Int)) (v_ArrVal_6828 (Array Int Int))) (not (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6825) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6828))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6824) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6829))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6830) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))))) is different from false [2023-11-06 22:05:00,690 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6830 (Array Int Int)) (v_ArrVal_6825 (Array Int Int)) (v_ArrVal_6824 (Array Int Int)) (v_ArrVal_6829 (Array Int Int)) (v_ArrVal_6828 (Array Int Int))) (not (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6825) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6828))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6824) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6829))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6830) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))))) is different from false [2023-11-06 22:05:00,714 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6830 (Array Int Int)) (v_ArrVal_6825 (Array Int Int)) (v_ArrVal_6824 (Array Int Int)) (v_ArrVal_6829 (Array Int Int)) (v_ArrVal_6828 (Array Int Int))) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6825) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6828))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6824) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6829))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6830) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4))))))))) is different from false [2023-11-06 22:05:00,763 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6830 (Array Int Int)) (v_ArrVal_6825 (Array Int Int)) (v_ArrVal_6824 (Array Int Int)) (v_ArrVal_6829 (Array Int Int)) (v_ArrVal_6828 (Array Int Int))) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6825) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6828))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6824) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6829))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6830) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ 4 .cse1)) (select .cse0 .cse1)))))))) is different from false [2023-11-06 22:05:00,798 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6830 (Array Int Int)) (v_ArrVal_6825 (Array Int Int)) (v_ArrVal_6824 (Array Int Int)) (v_ArrVal_6829 (Array Int Int)) (v_ArrVal_6828 (Array Int Int))) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6825) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6828))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6824) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6829))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6830) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1)))))))) is different from false [2023-11-06 22:05:01,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166646332] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:05:01,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:05:01,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 35] total 73 [2023-11-06 22:05:01,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923385350] [2023-11-06 22:05:01,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:05:01,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-06 22:05:01,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:01,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-06 22:05:01,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=6167, Unknown=54, NotChecked=1148, Total=7656 [2023-11-06 22:05:01,286 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 73 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 64 states have internal predecessors, (121), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:05:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:10,404 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2023-11-06 22:05:10,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-06 22:05:10,405 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 64 states have internal predecessors, (121), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 70 [2023-11-06 22:05:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:10,406 INFO L225 Difference]: With dead ends: 135 [2023-11-06 22:05:10,406 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 22:05:10,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=718, Invalid=11683, Unknown=59, NotChecked=1582, Total=14042 [2023-11-06 22:05:10,407 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 459 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:10,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1487 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-06 22:05:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 22:05:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 112. [2023-11-06 22:05:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 105 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:05:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2023-11-06 22:05:10,412 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 70 [2023-11-06 22:05:10,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:10,412 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2023-11-06 22:05:10,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 64 states have internal predecessors, (121), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:05:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2023-11-06 22:05:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-06 22:05:10,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:10,414 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:10,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-06 22:05:10,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9830ebb0-8bef-45e1-b62b-c07c1aeaf631/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:05:10,627 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 22:05:10,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:10,627 INFO L85 PathProgramCache]: Analyzing trace with hash -662157895, now seen corresponding path program 1 times [2023-11-06 22:05:10,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:10,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580036077] [2023-11-06 22:05:10,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:10,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat