./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:05:47,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:05:47,785 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 16:05:47,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:05:47,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:05:47,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:05:47,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:05:47,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:05:47,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:05:47,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:05:47,830 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:05:47,831 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:05:47,831 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:05:47,832 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 16:05:47,833 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:05:47,833 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:05:47,834 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 16:05:47,834 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 16:05:47,835 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:05:47,836 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 16:05:47,836 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 16:05:47,837 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 16:05:47,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 16:05:47,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 16:05:47,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:05:47,839 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:05:47,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:05:47,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:05:47,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:05:47,841 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 16:05:47,842 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 16:05:47,842 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 16:05:47,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:05:47,843 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 16:05:47,843 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 16:05:47,843 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:05:47,844 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:05:47,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:05:47,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:05:47,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:05:47,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:05:47,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:05:47,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:05:47,845 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 16:05:47,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 16:05:47,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:05:47,846 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:05:47,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:05:47,846 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/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_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2023-12-02 16:05:48,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:05:48,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:05:48,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:05:48,105 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:05:48,105 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:05:48,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-12-02 16:05:50,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:05:51,074 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:05:51,075 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-12-02 16:05:51,091 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/data/5e45f8502/be1d1a1b1a9a47cfbf67b3768601f000/FLAGaa8b8b76d [2023-12-02 16:05:51,114 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/data/5e45f8502/be1d1a1b1a9a47cfbf67b3768601f000 [2023-12-02 16:05:51,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:05:51,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:05:51,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:05:51,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:05:51,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:05:51,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2012a499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51, skipping insertion in model container [2023-12-02 16:05:51,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,179 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:05:51,456 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:05:51,467 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 16:05:51,513 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:05:51,547 INFO L206 MainTranslator]: Completed translation [2023-12-02 16:05:51,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51 WrapperNode [2023-12-02 16:05:51,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:05:51,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 16:05:51,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 16:05:51,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 16:05:51,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,597 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 183 [2023-12-02 16:05:51,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 16:05:51,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 16:05:51,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 16:05:51,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 16:05:51,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 16:05:51,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 16:05:51,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 16:05:51,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 16:05:51,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51" (1/1) ... [2023-12-02 16:05:51,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:05:51,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:05:51,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 16:05:51,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 16:05:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 16:05:51,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 16:05:51,692 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 16:05:51,692 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 16:05:51,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 16:05:51,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 16:05:51,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 16:05:51,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 16:05:51,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 16:05:51,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 16:05:51,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 16:05:51,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 16:05:51,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 16:05:51,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 16:05:51,818 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 16:05:51,820 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 16:05:52,207 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 16:05:52,271 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 16:05:52,272 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-02 16:05:52,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:05:52 BoogieIcfgContainer [2023-12-02 16:05:52,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 16:05:52,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 16:05:52,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 16:05:52,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 16:05:52,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:05:51" (1/3) ... [2023-12-02 16:05:52,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e01efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:05:52, skipping insertion in model container [2023-12-02 16:05:52,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:51" (2/3) ... [2023-12-02 16:05:52,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e01efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:05:52, skipping insertion in model container [2023-12-02 16:05:52,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:05:52" (3/3) ... [2023-12-02 16:05:52,284 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-12-02 16:05:52,304 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 16:05:52,305 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-12-02 16:05:52,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 16:05:52,365 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=FINITE_AUTOMATA, 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;@1114bda0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 16:05:52,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2023-12-02 16:05:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 59 states have (on average 2.3220338983050848) internal successors, (137), 121 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-12-02 16:05:52,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 16:05:52,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:05:52,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 16:05:52,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:05:52,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:05:52,381 INFO L85 PathProgramCache]: Analyzing trace with hash 278979000, now seen corresponding path program 1 times [2023-12-02 16:05:52,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:05:52,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749929267] [2023-12-02 16:05:52,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:05:52,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:05:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:05:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:05:52,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:05:52,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749929267] [2023-12-02 16:05:52,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749929267] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:05:52,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:05:52,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:05:52,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691455090] [2023-12-02 16:05:52,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:05:52,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:05:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:05:52,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:05:52,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:05:52,678 INFO L87 Difference]: Start difference. First operand has 126 states, 59 states have (on average 2.3220338983050848) internal successors, (137), 121 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-12-02 16:05:52,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:05:52,846 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2023-12-02 16:05:52,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:05:52,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2023-12-02 16:05:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:05:52,858 INFO L225 Difference]: With dead ends: 123 [2023-12-02 16:05:52,858 INFO L226 Difference]: Without dead ends: 121 [2023-12-02 16:05:52,860 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-12-02 16:05:52,864 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 6 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:05:52,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 176 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:05:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-02 16:05:52,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-12-02 16:05:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 116 states have internal predecessors, (127), 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-12-02 16:05:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2023-12-02 16:05:52,912 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 5 [2023-12-02 16:05:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:05:52,912 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2023-12-02 16:05:52,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-12-02 16:05:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2023-12-02 16:05:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 16:05:52,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:05:52,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 16:05:52,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 16:05:52,914 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:05:52,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:05:52,915 INFO L85 PathProgramCache]: Analyzing trace with hash 278979001, now seen corresponding path program 1 times [2023-12-02 16:05:52,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:05:52,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061251711] [2023-12-02 16:05:52,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:05:52,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:05:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:05:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:05:53,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:05:53,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061251711] [2023-12-02 16:05:53,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061251711] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:05:53,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:05:53,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:05:53,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311779471] [2023-12-02 16:05:53,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:05:53,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:05:53,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:05:53,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:05:53,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:05:53,051 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-12-02 16:05:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:05:53,200 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2023-12-02 16:05:53,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:05:53,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2023-12-02 16:05:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:05:53,203 INFO L225 Difference]: With dead ends: 119 [2023-12-02 16:05:53,203 INFO L226 Difference]: Without dead ends: 119 [2023-12-02 16:05:53,203 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-12-02 16:05:53,205 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:05:53,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:05:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-02 16:05:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-12-02 16:05:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 57 states have (on average 2.192982456140351) internal successors, (125), 114 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-12-02 16:05:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-12-02 16:05:53,219 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 5 [2023-12-02 16:05:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:05:53,219 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-12-02 16:05:53,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-12-02 16:05:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2023-12-02 16:05:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 16:05:53,220 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:05:53,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:05:53,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 16:05:53,221 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:05:53,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:05:53,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1927405842, now seen corresponding path program 1 times [2023-12-02 16:05:53,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:05:53,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395055896] [2023-12-02 16:05:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:05:53,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:05:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:05:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:05:53,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:05:53,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395055896] [2023-12-02 16:05:53,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395055896] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:05:53,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:05:53,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:05:53,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28524689] [2023-12-02 16:05:53,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:05:53,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:05:53,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:05:53,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:05:53,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:05:53,313 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-12-02 16:05:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:05:53,361 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2023-12-02 16:05:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:05:53,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2023-12-02 16:05:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:05:53,364 INFO L225 Difference]: With dead ends: 125 [2023-12-02 16:05:53,364 INFO L226 Difference]: Without dead ends: 125 [2023-12-02 16:05:53,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-02 16:05:53,366 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:05:53,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 222 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:05:53,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-12-02 16:05:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2023-12-02 16:05:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 58 states have (on average 2.1724137931034484) internal successors, (126), 115 states have internal predecessors, (126), 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-12-02 16:05:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-12-02 16:05:53,379 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 10 [2023-12-02 16:05:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:05:53,380 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-12-02 16:05:53,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-12-02 16:05:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-12-02 16:05:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 16:05:53,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:05:53,381 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:05:53,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 16:05:53,382 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:05:53,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:05:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607865, now seen corresponding path program 1 times [2023-12-02 16:05:53,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:05:53,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216310578] [2023-12-02 16:05:53,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:05:53,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:05:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:05:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:05:53,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:05:53,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216310578] [2023-12-02 16:05:53,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216310578] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:05:53,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:05:53,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:05:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651288288] [2023-12-02 16:05:53,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:05:53,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:05:53,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:05:53,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:05:53,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:05:53,529 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-12-02 16:05:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:05:53,762 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2023-12-02 16:05:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:05:53,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 17 [2023-12-02 16:05:53,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:05:53,764 INFO L225 Difference]: With dead ends: 119 [2023-12-02 16:05:53,764 INFO L226 Difference]: Without dead ends: 119 [2023-12-02 16:05:53,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:05:53,766 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:05:53,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 356 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:05:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-02 16:05:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-12-02 16:05:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 58 states have (on average 2.1551724137931036) internal successors, (125), 114 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-12-02 16:05:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-12-02 16:05:53,776 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 17 [2023-12-02 16:05:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:05:53,776 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-12-02 16:05:53,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-12-02 16:05:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2023-12-02 16:05:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 16:05:53,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:05:53,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:05:53,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 16:05:53,778 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:05:53,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:05:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607864, now seen corresponding path program 1 times [2023-12-02 16:05:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:05:53,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955149818] [2023-12-02 16:05:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:05:53,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:05:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:05:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:05:53,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:05:53,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955149818] [2023-12-02 16:05:53,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955149818] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:05:53,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:05:53,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:05:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335986396] [2023-12-02 16:05:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:05:53,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:05:53,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:05:53,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:05:53,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:05:53,998 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-12-02 16:05:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:05:54,214 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2023-12-02 16:05:54,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:05:54,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2023-12-02 16:05:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:05:54,216 INFO L225 Difference]: With dead ends: 118 [2023-12-02 16:05:54,216 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 16:05:54,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:05:54,218 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:05:54,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 380 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:05:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 16:05:54,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-12-02 16:05:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 113 states have internal predecessors, (124), 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-12-02 16:05:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2023-12-02 16:05:54,227 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 17 [2023-12-02 16:05:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:05:54,227 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2023-12-02 16:05:54,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-12-02 16:05:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2023-12-02 16:05:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 16:05:54,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:05:54,229 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:05:54,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 16:05:54,229 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:05:54,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:05:54,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1095361633, now seen corresponding path program 1 times [2023-12-02 16:05:54,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:05:54,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955888245] [2023-12-02 16:05:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:05:54,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:05:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:05:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:05:54,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:05:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955888245] [2023-12-02 16:05:54,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955888245] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:05:54,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058715864] [2023-12-02 16:05:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:05:54,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:05:54,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:05:54,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:05:54,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 16:05:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:05:54,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 16:05:54,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:05:54,644 INFO L378 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-12-02 16:05:54,688 WARN L876 $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-12-02 16:05:54,768 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 16:05:54,769 INFO L378 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-12-02 16:05:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-12-02 16:05:54,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:05:54,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058715864] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:05:54,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1557656775] [2023-12-02 16:05:54,885 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 16:05:54,886 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:05:54,891 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:05:54,896 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:05:54,897 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:05:56,349 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-12-02 16:05:56,476 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:05:58,887 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1436#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-12-02 16:05:58,887 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:05:58,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:05:58,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2023-12-02 16:05:58,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244955382] [2023-12-02 16:05:58,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:05:58,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 16:05:58,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:05:58,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 16:05:58,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=433, Unknown=1, NotChecked=42, Total=552 [2023-12-02 16:05:58,890 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 16:05:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:05:59,250 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2023-12-02 16:05:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 16:05:59,250 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2023-12-02 16:05:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:05:59,251 INFO L225 Difference]: With dead ends: 117 [2023-12-02 16:05:59,251 INFO L226 Difference]: Without dead ends: 117 [2023-12-02 16:05:59,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=94, Invalid=509, Unknown=1, NotChecked=46, Total=650 [2023-12-02 16:05:59,253 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 5 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:05:59,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 458 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 415 Invalid, 0 Unknown, 124 Unchecked, 0.3s Time] [2023-12-02 16:05:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-02 16:05:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-12-02 16:05:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 58 states have (on average 2.1206896551724137) internal successors, (123), 112 states have internal predecessors, (123), 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-12-02 16:05:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2023-12-02 16:05:59,260 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 19 [2023-12-02 16:05:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:05:59,261 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2023-12-02 16:05:59,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 16:05:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2023-12-02 16:05:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 16:05:59,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:05:59,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:05:59,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 16:05:59,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 16:05:59,463 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:05:59,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:05:59,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1095361634, now seen corresponding path program 1 times [2023-12-02 16:05:59,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:05:59,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804751785] [2023-12-02 16:05:59,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:05:59,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:05:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:05:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:05:59,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:05:59,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804751785] [2023-12-02 16:05:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804751785] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:05:59,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029977274] [2023-12-02 16:05:59,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:05:59,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:05:59,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:05:59,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:05:59,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 16:05:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:05:59,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-02 16:05:59,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:05:59,818 INFO L378 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-12-02 16:05:59,996 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:05:59,996 INFO L378 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 16 treesize of output 15 [2023-12-02 16:06:00,010 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:06:00,011 INFO L378 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-12-02 16:06:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:06:00,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:06:00,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029977274] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:00,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2046964220] [2023-12-02 16:06:00,204 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 16:06:00,204 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:06:00,204 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:06:00,204 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:06:00,204 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:06:00,898 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-12-02 16:06:00,987 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:06:03,083 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1775#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-12-02 16:06:03,083 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:06:03,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:06:03,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-12-02 16:06:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180360549] [2023-12-02 16:06:03,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:06:03,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 16:06:03,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:03,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 16:06:03,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=887, Unknown=1, NotChecked=0, Total=992 [2023-12-02 16:06:03,085 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:06:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:03,775 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2023-12-02 16:06:03,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 16:06:03,775 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-12-02 16:06:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:03,776 INFO L225 Difference]: With dead ends: 118 [2023-12-02 16:06:03,776 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 16:06:03,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=144, Invalid=1187, Unknown=1, NotChecked=0, Total=1332 [2023-12-02 16:06:03,778 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:03,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 943 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 16:06:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 16:06:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2023-12-02 16:06:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 58 states have (on average 2.103448275862069) internal successors, (122), 111 states have internal predecessors, (122), 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-12-02 16:06:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2023-12-02 16:06:03,785 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 19 [2023-12-02 16:06:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:03,786 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2023-12-02 16:06:03,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:06:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2023-12-02 16:06:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 16:06:03,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:03,787 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:06:03,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 16:06:03,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 16:06:03,993 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:03,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:03,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1055866954, now seen corresponding path program 1 times [2023-12-02 16:06:03,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:03,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906665304] [2023-12-02 16:06:03,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:03,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:06:04,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:04,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906665304] [2023-12-02 16:06:04,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906665304] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:04,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913692856] [2023-12-02 16:06:04,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:04,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:04,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:06:04,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:06:04,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 16:06:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:04,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 16:06:04,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:06:04,654 INFO L378 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-12-02 16:06:04,693 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:06:04,693 INFO L378 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-12-02 16:06:04,762 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:06:04,762 INFO L378 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 18 treesize of output 17 [2023-12-02 16:06:04,882 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-12-02 16:06:04,897 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 16:06:04,898 INFO L378 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 12 treesize of output 14 [2023-12-02 16:06:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2023-12-02 16:06:04,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:06:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:06:05,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913692856] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:06:05,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2074913235] [2023-12-02 16:06:05,489 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 16:06:05,489 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:06:05,489 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:06:05,489 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:06:05,490 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:06:06,337 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:06:06,361 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:06:09,907 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2215#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_insert_~data#1|) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (or (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_159| (Array Int Int))) (and (= (store |v_#valid_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_52| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_31| (Array Int Int)) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_old(#length)_AFTER_CALL_31| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (= (store |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_#memory_int_BEFORE_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0))) |v_#memory_int_BEFORE_CALL_52|) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (exists ((|v_#memory_$Pointer$.offset_129| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_101| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))) (= (store |v_#memory_int_100| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_100| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_101|))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_131| (Array Int Int))) (= (store |v_#length_131| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8) |#length|))) (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_159| (Array Int Int))) (and (= (store |v_#valid_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_30| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_30| (Array Int Int)) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_old(#length)_AFTER_CALL_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= |v_old(#memory_int)_AFTER_CALL_30| (store |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (= 1 (select |v_old(#valid)_AFTER_CALL_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (exists ((|v_#memory_$Pointer$.offset_129| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_101| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))) (= (store |v_#memory_int_100| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_100| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_101|))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_131| (Array Int Int))) (= (store |v_#length_131| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8) |#length|)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 5))' at error location [2023-12-02 16:06:09,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:06:09,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:06:09,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 26 [2023-12-02 16:06:09,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021258090] [2023-12-02 16:06:09,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:06:09,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 16:06:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:09,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 16:06:09,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1534, Unknown=6, NotChecked=80, Total=1806 [2023-12-02 16:06:09,911 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 23 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-02 16:06:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:10,441 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2023-12-02 16:06:10,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 16:06:10,442 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 23 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 27 [2023-12-02 16:06:10,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:10,443 INFO L225 Difference]: With dead ends: 124 [2023-12-02 16:06:10,443 INFO L226 Difference]: Without dead ends: 124 [2023-12-02 16:06:10,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=229, Invalid=1749, Unknown=6, NotChecked=86, Total=2070 [2023-12-02 16:06:10,445 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 337 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:10,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 409 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 599 Invalid, 0 Unknown, 132 Unchecked, 0.4s Time] [2023-12-02 16:06:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-02 16:06:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2023-12-02 16:06:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 102 states have internal predecessors, (113), 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-12-02 16:06:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2023-12-02 16:06:10,451 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 27 [2023-12-02 16:06:10,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:10,452 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2023-12-02 16:06:10,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 23 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-02 16:06:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2023-12-02 16:06:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 16:06:10,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:10,453 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:06:10,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 16:06:10,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-02 16:06:10,657 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:10,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1055866955, now seen corresponding path program 1 times [2023-12-02 16:06:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:10,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881621922] [2023-12-02 16:06:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:06:11,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:11,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881621922] [2023-12-02 16:06:11,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881621922] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:11,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429897048] [2023-12-02 16:06:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:11,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:11,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:06:11,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:06:11,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 16:06:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:11,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-02 16:06:11,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:06:11,501 INFO L378 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-12-02 16:06:11,525 INFO L378 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-12-02 16:06:11,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:11,598 INFO L378 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-12-02 16:06:11,680 INFO L378 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-12-02 16:06:11,752 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:06:11,752 INFO L378 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-12-02 16:06:11,865 INFO L378 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-12-02 16:06:12,012 INFO L349 Elim1Store]: treesize reduction 12, result has 86.5 percent of original size [2023-12-02 16:06:12,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 172 treesize of output 203 [2023-12-02 16:06:12,126 INFO L378 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 23 treesize of output 19 [2023-12-02 16:06:12,133 INFO L378 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 7 treesize of output 5 [2023-12-02 16:06:12,136 INFO L378 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 6 treesize of output 4 [2023-12-02 16:06:12,170 INFO L378 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-12-02 16:06:12,177 WARN L876 $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-12-02 16:06:12,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:12,200 INFO L378 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-12-02 16:06:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2023-12-02 16:06:12,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:06:12,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429897048] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:12,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1172300031] [2023-12-02 16:06:12,333 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 16:06:12,333 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:06:12,333 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:06:12,333 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:06:12,334 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:06:13,318 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:06:13,338 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:06:17,191 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2581#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 3) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_insert_~data#1|) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0) (or (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (exists ((|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))) (= (store |v_#memory_int_112| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_112| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_113|))) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_166| (Array Int Int))) (and (= (select |v_#valid_166| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_166| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_143| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_143| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_old(#length)_AFTER_CALL_44| (Array Int Int)) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_145| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_44| (store |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_44| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_44| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_44| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (select (select (store |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select (store |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_141| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_141| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_141| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#length_144| (Array Int Int))) (= |#length| (store |v_#length_144| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (and (exists ((|v_old(#length)_AFTER_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_145| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_#memory_int_BEFORE_CALL_73| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0))) |v_#memory_int_BEFORE_CALL_73|) (= (select (select (store |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select (store |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_old(#length)_AFTER_CALL_43| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (exists ((|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))) (= (store |v_#memory_int_112| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_112| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_113|))) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_166| (Array Int Int))) (and (= (select |v_#valid_166| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_166| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_143| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_143| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_141| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_141| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_141| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#length_144| (Array Int Int))) (= |#length| (store |v_#length_144| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 5))' at error location [2023-12-02 16:06:17,191 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:06:17,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:06:17,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2023-12-02 16:06:17,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718150032] [2023-12-02 16:06:17,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:06:17,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 16:06:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:17,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 16:06:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1509, Unknown=13, NotChecked=78, Total=1722 [2023-12-02 16:06:17,195 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 25 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 20 states have internal predecessors, (40), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 16:06:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:18,470 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2023-12-02 16:06:18,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 16:06:18,471 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 20 states have internal predecessors, (40), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2023-12-02 16:06:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:18,473 INFO L225 Difference]: With dead ends: 121 [2023-12-02 16:06:18,473 INFO L226 Difference]: Without dead ends: 121 [2023-12-02 16:06:18,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=200, Invalid=2239, Unknown=15, NotChecked=96, Total=2550 [2023-12-02 16:06:18,474 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 249 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:18,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 506 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1223 Invalid, 0 Unknown, 133 Unchecked, 0.9s Time] [2023-12-02 16:06:18,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-02 16:06:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2023-12-02 16:06:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.793103448275862) internal successors, (104), 93 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-12-02 16:06:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2023-12-02 16:06:18,478 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 27 [2023-12-02 16:06:18,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:18,478 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2023-12-02 16:06:18,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 20 states have internal predecessors, (40), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 16:06:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2023-12-02 16:06:18,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 16:06:18,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:18,479 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:06:18,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 16:06:18,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:18,680 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:18,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1076082385, now seen corresponding path program 1 times [2023-12-02 16:06:18,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:18,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737503362] [2023-12-02 16:06:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:18,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:06:19,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737503362] [2023-12-02 16:06:19,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737503362] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:19,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245079949] [2023-12-02 16:06:19,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:19,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:19,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:06:19,122 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:06:19,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 16:06:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:19,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 16:06:19,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:06:19,317 INFO L378 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-12-02 16:06:19,449 INFO L378 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-12-02 16:06:19,547 WARN L876 $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-12-02 16:06:19,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:19,558 INFO L378 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-12-02 16:06:19,576 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-12-02 16:06:19,576 INFO L378 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-12-02 16:06:19,608 INFO L378 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-12-02 16:06:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 16:06:19,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:06:19,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245079949] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:19,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1902751012] [2023-12-02 16:06:19,711 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 16:06:19,711 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:06:19,711 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:06:19,711 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:06:19,711 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:06:20,592 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:06:20,606 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:06:25,554 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2957#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_insert_~data#1|) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) 1)) (or (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_153| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.base_163| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|v_#length_BEFORE_CALL_109| (Array Int Int)) (|v_#memory_$Pointer$.offset_157| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_101| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.base_163| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_163| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |v_#memory_int_BEFORE_CALL_101| (store |v_#memory_int_128| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_128| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_#memory_int_BEFORE_CALL_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_157| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_157| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_#length_BEFORE_CALL_109| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_58| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1))) (exists ((|v_#length_151| (Array Int Int))) (= |#length| (store |v_#length_151| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.base_159| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_124| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_124| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_125|) (= |#memory_int| (store |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_177| (Array Int Int))) (and (= (select |v_#valid_177| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= |#valid| (store |v_#valid_177| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1))))) (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_153| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#length_151| (Array Int Int))) (= |#length| (store |v_#length_151| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.base_159| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.base_163| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_59| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_#length_BEFORE_CALL_111| (Array Int Int)) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_59| (Array Int Int)) (|v_#memory_$Pointer$.offset_157| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1) (= (select (select (store |v_#memory_$Pointer$.base_163| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_163| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select (store |v_#memory_$Pointer$.offset_157| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_157| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_59| (store |v_#memory_int_128| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_128| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (<= 4 (select |v_#length_BEFORE_CALL_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)))) (exists ((|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_124| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_124| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_125|) (= |#memory_int| (store |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_177| (Array Int Int))) (and (= (select |v_#valid_177| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= |#valid| (store |v_#valid_177| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1)))))) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)))' at error location [2023-12-02 16:06:25,554 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:06:25,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:06:25,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-12-02 16:06:25,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132779237] [2023-12-02 16:06:25,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:06:25,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 16:06:25,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:25,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 16:06:25,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1506, Unknown=10, NotChecked=78, Total=1722 [2023-12-02 16:06:25,557 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 21 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:06:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:26,389 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2023-12-02 16:06:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 16:06:26,390 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 21 states have internal predecessors, (37), 4 states have call successors, (6), 2 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 29 [2023-12-02 16:06:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:26,391 INFO L225 Difference]: With dead ends: 128 [2023-12-02 16:06:26,391 INFO L226 Difference]: Without dead ends: 128 [2023-12-02 16:06:26,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=193, Invalid=2153, Unknown=10, NotChecked=94, Total=2450 [2023-12-02 16:06:26,392 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 375 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:26,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 587 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 847 Invalid, 0 Unknown, 143 Unchecked, 0.5s Time] [2023-12-02 16:06:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-02 16:06:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 100. [2023-12-02 16:06:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.8) internal successors, (108), 95 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-12-02 16:06:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2023-12-02 16:06:26,396 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 29 [2023-12-02 16:06:26,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:26,396 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2023-12-02 16:06:26,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 21 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:06:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2023-12-02 16:06:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 16:06:26,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:26,397 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:06:26,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 16:06:26,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:26,598 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:26,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:26,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1076082386, now seen corresponding path program 1 times [2023-12-02 16:06:26,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:26,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099258751] [2023-12-02 16:06:26,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:26,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:06:27,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:27,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099258751] [2023-12-02 16:06:27,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099258751] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:27,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748007359] [2023-12-02 16:06:27,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:27,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:27,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:06:27,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:06:27,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 16:06:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:27,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-02 16:06:27,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:06:27,843 INFO L378 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 25 treesize of output 17 [2023-12-02 16:06:27,847 INFO L378 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-12-02 16:06:27,903 WARN L876 $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-12-02 16:06:27,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:27,919 INFO L378 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 33 treesize of output 26 [2023-12-02 16:06:27,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:27,926 INFO L378 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-12-02 16:06:27,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:27,931 INFO L378 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 24 [2023-12-02 16:06:27,945 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:06:27,945 INFO L378 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-12-02 16:06:27,985 INFO L378 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 23 treesize of output 15 [2023-12-02 16:06:27,988 INFO L378 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 26 treesize of output 14 [2023-12-02 16:06:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2023-12-02 16:06:28,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:06:28,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748007359] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:28,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [357856620] [2023-12-02 16:06:28,263 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 16:06:28,263 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:06:28,264 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:06:28,264 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:06:28,264 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:06:29,110 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:06:29,125 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:06:34,563 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3345#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (or (< (select |#length| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 4)) (< |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_insert_~data#1|) (or (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_169| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_169| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_169| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#length_161| (Array Int Int))) (= (store |v_#length_161| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8) |#length|)) (exists ((|v_#memory_int_136| (Array Int (Array Int Int))) (|v_#memory_int_137| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_136| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_136| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_137| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_137|) (= |#memory_int| (store |v_#memory_int_137| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_137| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))))) (exists ((|v_#memory_$Pointer$.base_175| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_175| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_175| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| Int) (|v_#memory_$Pointer$.offset_173| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_71| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_179| (Array Int (Array Int Int))) (|v_#memory_int_140| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_71| (Array Int Int)) (|v_old(#length)_AFTER_CALL_71| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_71| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 1) (= |v_old(#memory_int)_AFTER_CALL_71| (store |v_#memory_int_140| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_int_140| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_71| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_173| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.offset_173| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_179| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.base_179| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_old(#length)_AFTER_CALL_71| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|)))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_186| (Array Int Int))) (and (= |#valid| (store |v_#valid_186| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1)) (= (select |v_#valid_186| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0)))) (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_169| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_169| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_169| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#length_161| (Array Int Int))) (= (store |v_#length_161| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8) |#length|)) (exists ((|v_#memory_int_136| (Array Int (Array Int Int))) (|v_#memory_int_137| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_136| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_136| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_137| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_137|) (= |#memory_int| (store |v_#memory_int_137| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_137| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))))) (exists ((|v_#memory_$Pointer$.base_175| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_175| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_175| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_72| (Array Int Int)) (|v_#length_BEFORE_CALL_136| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| Int) (|v_#memory_$Pointer$.offset_173| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_179| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_72| (Array Int (Array Int Int))) (|v_#memory_int_140| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_72| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_173| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.offset_173| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_72| (store |v_#memory_int_140| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_int_140| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_72| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0)))) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_179| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.base_179| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_#length_BEFORE_CALL_136| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|)))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_186| (Array Int Int))) (and (= |#valid| (store |v_#valid_186| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1)) (= (select |v_#valid_186| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))))) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:06:34,563 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:06:34,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:06:34,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2023-12-02 16:06:34,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663785731] [2023-12-02 16:06:34,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:06:34,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 16:06:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:34,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 16:06:34,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1747, Unknown=9, NotChecked=84, Total=1980 [2023-12-02 16:06:34,565 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 25 states, 18 states have (on average 2.0) internal successors, (36), 22 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:06:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:35,715 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. [2023-12-02 16:06:35,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 16:06:35,715 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 2.0) internal successors, (36), 22 states have internal predecessors, (36), 4 states have call successors, (6), 2 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 29 [2023-12-02 16:06:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:35,716 INFO L225 Difference]: With dead ends: 123 [2023-12-02 16:06:35,717 INFO L226 Difference]: Without dead ends: 123 [2023-12-02 16:06:35,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=218, Invalid=2638, Unknown=10, NotChecked=104, Total=2970 [2023-12-02 16:06:35,719 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 213 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:35,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 633 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 890 Invalid, 0 Unknown, 138 Unchecked, 0.6s Time] [2023-12-02 16:06:35,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-02 16:06:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 100. [2023-12-02 16:06:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.7833333333333334) internal successors, (107), 95 states have internal predecessors, (107), 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-12-02 16:06:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2023-12-02 16:06:35,722 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 29 [2023-12-02 16:06:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:35,722 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2023-12-02 16:06:35,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 18 states have (on average 2.0) internal successors, (36), 22 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:06:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2023-12-02 16:06:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 16:06:35,723 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:35,723 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:06:35,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 16:06:35,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 16:06:35,924 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:35,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:35,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1000967905, now seen corresponding path program 1 times [2023-12-02 16:06:35,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:35,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929554700] [2023-12-02 16:06:35,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:35,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:06:35,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:35,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929554700] [2023-12-02 16:06:35,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929554700] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:06:35,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:06:35,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:06:35,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264760391] [2023-12-02 16:06:35,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:06:35,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:06:35,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:35,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:06:35,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:06:35,970 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-12-02 16:06:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:36,014 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2023-12-02 16:06:36,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:06:36,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 30 [2023-12-02 16:06:36,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:36,015 INFO L225 Difference]: With dead ends: 102 [2023-12-02 16:06:36,016 INFO L226 Difference]: Without dead ends: 102 [2023-12-02 16:06:36,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-02 16:06:36,017 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 16 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:36,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 161 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:06:36,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-02 16:06:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2023-12-02 16:06:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 61 states have (on average 1.7704918032786885) internal successors, (108), 96 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-12-02 16:06:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2023-12-02 16:06:36,020 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 30 [2023-12-02 16:06:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:36,021 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2023-12-02 16:06:36,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-12-02 16:06:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2023-12-02 16:06:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 16:06:36,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:36,022 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:06:36,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 16:06:36,022 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:36,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash -971734514, now seen corresponding path program 1 times [2023-12-02 16:06:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:36,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129121771] [2023-12-02 16:06:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:36,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:06:36,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:36,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129121771] [2023-12-02 16:06:36,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129121771] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:36,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082965812] [2023-12-02 16:06:36,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:36,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:36,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:06:36,158 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:06:36,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 16:06:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:36,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 16:06:36,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:06:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:06:36,347 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:06:36,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082965812] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:06:36,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:06:36,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2023-12-02 16:06:36,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886089606] [2023-12-02 16:06:36,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:06:36,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:06:36,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:36,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:06:36,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:06:36,349 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-12-02 16:06:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:36,409 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2023-12-02 16:06:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:06:36,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 31 [2023-12-02 16:06:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:36,410 INFO L225 Difference]: With dead ends: 98 [2023-12-02 16:06:36,411 INFO L226 Difference]: Without dead ends: 98 [2023-12-02 16:06:36,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:06:36,411 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 114 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:36,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 217 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:06:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-02 16:06:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-02 16:06:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.7333333333333334) internal successors, (104), 93 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-12-02 16:06:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2023-12-02 16:06:36,416 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 31 [2023-12-02 16:06:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:36,416 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2023-12-02 16:06:36,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-12-02 16:06:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2023-12-02 16:06:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 16:06:36,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:36,417 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:06:36,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 16:06:36,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 16:06:36,618 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:36,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:36,619 INFO L85 PathProgramCache]: Analyzing trace with hash -58782334, now seen corresponding path program 1 times [2023-12-02 16:06:36,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:36,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104819414] [2023-12-02 16:06:36,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:36,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:06:36,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104819414] [2023-12-02 16:06:36,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104819414] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:06:36,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:06:36,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:06:36,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893447748] [2023-12-02 16:06:36,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:06:36,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:06:36,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:06:36,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:06:36,689 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-12-02 16:06:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:36,808 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2023-12-02 16:06:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:06:36,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 32 [2023-12-02 16:06:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:36,809 INFO L225 Difference]: With dead ends: 112 [2023-12-02 16:06:36,809 INFO L226 Difference]: Without dead ends: 112 [2023-12-02 16:06:36,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-02 16:06:36,810 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 21 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:36,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 192 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:06:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-02 16:06:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2023-12-02 16:06:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 92 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-12-02 16:06:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2023-12-02 16:06:36,813 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 32 [2023-12-02 16:06:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:36,814 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2023-12-02 16:06:36,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-12-02 16:06:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2023-12-02 16:06:36,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 16:06:36,815 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:36,815 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:06:36,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 16:06:36,815 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:36,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:36,816 INFO L85 PathProgramCache]: Analyzing trace with hash -58782333, now seen corresponding path program 1 times [2023-12-02 16:06:36,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:36,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746794925] [2023-12-02 16:06:36,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:36,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:06:36,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:36,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746794925] [2023-12-02 16:06:36,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746794925] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:06:36,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:06:36,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:06:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149176556] [2023-12-02 16:06:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:06:36,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:06:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:36,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:06:36,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:06:36,926 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-12-02 16:06:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:37,049 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2023-12-02 16:06:37,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:06:37,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 32 [2023-12-02 16:06:37,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:37,050 INFO L225 Difference]: With dead ends: 111 [2023-12-02 16:06:37,050 INFO L226 Difference]: Without dead ends: 111 [2023-12-02 16:06:37,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-02 16:06:37,051 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 20 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:37,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 204 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:06:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-02 16:06:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2023-12-02 16:06:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.7) internal successors, (102), 91 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-12-02 16:06:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2023-12-02 16:06:37,055 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 32 [2023-12-02 16:06:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:37,055 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2023-12-02 16:06:37,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-12-02 16:06:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2023-12-02 16:06:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 16:06:37,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:37,057 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:06:37,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 16:06:37,057 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:37,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:37,057 INFO L85 PathProgramCache]: Analyzing trace with hash 142765312, now seen corresponding path program 1 times [2023-12-02 16:06:37,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:37,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128253893] [2023-12-02 16:06:37,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:37,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 16:06:37,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:37,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128253893] [2023-12-02 16:06:37,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128253893] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:06:37,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:06:37,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:06:37,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079963753] [2023-12-02 16:06:37,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:06:37,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:06:37,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:37,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:06:37,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:06:37,153 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-12-02 16:06:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:37,294 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2023-12-02 16:06:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:06:37,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 32 [2023-12-02 16:06:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:37,295 INFO L225 Difference]: With dead ends: 93 [2023-12-02 16:06:37,295 INFO L226 Difference]: Without dead ends: 93 [2023-12-02 16:06:37,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:06:37,296 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 19 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:37,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 250 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:06:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-02 16:06:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-02 16:06:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.65) internal successors, (99), 88 states have internal predecessors, (99), 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-12-02 16:06:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2023-12-02 16:06:37,300 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 32 [2023-12-02 16:06:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:37,300 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2023-12-02 16:06:37,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-12-02 16:06:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2023-12-02 16:06:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 16:06:37,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:37,301 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:06:37,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 16:06:37,302 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:37,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:37,302 INFO L85 PathProgramCache]: Analyzing trace with hash 142765313, now seen corresponding path program 1 times [2023-12-02 16:06:37,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:37,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014307734] [2023-12-02 16:06:37,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:37,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:06:37,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:37,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014307734] [2023-12-02 16:06:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014307734] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:37,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801223581] [2023-12-02 16:06:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:37,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:37,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:06:37,445 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:06:37,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 16:06:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:37,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 16:06:37,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:06:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:06:37,654 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:06:37,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801223581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:06:37,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:06:37,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-02 16:06:37,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730911400] [2023-12-02 16:06:37,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:06:37,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:06:37,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:37,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:06:37,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:06:37,656 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-12-02 16:06:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:37,703 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2023-12-02 16:06:37,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:06:37,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 32 [2023-12-02 16:06:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:37,705 INFO L225 Difference]: With dead ends: 92 [2023-12-02 16:06:37,705 INFO L226 Difference]: Without dead ends: 92 [2023-12-02 16:06:37,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:06:37,705 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 87 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:37,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 165 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:06:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-02 16:06:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-02 16:06:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 87 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-12-02 16:06:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2023-12-02 16:06:37,709 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 32 [2023-12-02 16:06:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:37,709 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2023-12-02 16:06:37,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-12-02 16:06:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2023-12-02 16:06:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 16:06:37,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:37,710 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:06:37,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 16:06:37,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 16:06:37,911 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:37,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1822252326, now seen corresponding path program 1 times [2023-12-02 16:06:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:37,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980611790] [2023-12-02 16:06:37,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:37,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 16:06:38,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:38,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980611790] [2023-12-02 16:06:38,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980611790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:06:38,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:06:38,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:06:38,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001134458] [2023-12-02 16:06:38,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:06:38,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:06:38,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:38,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:06:38,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:06:38,055 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-12-02 16:06:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:38,199 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2023-12-02 16:06:38,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:06:38,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 33 [2023-12-02 16:06:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:38,200 INFO L225 Difference]: With dead ends: 89 [2023-12-02 16:06:38,200 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 16:06:38,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:06:38,201 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 14 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:38,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 274 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:06:38,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 16:06:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-02 16:06:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 84 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-12-02 16:06:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2023-12-02 16:06:38,204 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 33 [2023-12-02 16:06:38,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:38,204 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2023-12-02 16:06:38,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-12-02 16:06:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2023-12-02 16:06:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 16:06:38,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:38,205 INFO L195 NwaCegarLoop]: trace histogram [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-12-02 16:06:38,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 16:06:38,205 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:38,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1667614348, now seen corresponding path program 1 times [2023-12-02 16:06:38,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:38,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343389391] [2023-12-02 16:06:38,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:38,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:06:38,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:38,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343389391] [2023-12-02 16:06:38,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343389391] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:38,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916527291] [2023-12-02 16:06:38,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:38,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:38,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:06:38,837 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:06:38,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 16:06:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:39,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 16:06:39,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:06:39,021 INFO L378 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-12-02 16:06:39,167 INFO L378 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-12-02 16:06:39,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:39,295 INFO L378 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-12-02 16:06:39,307 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-02 16:06:39,307 INFO L378 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 18 treesize of output 21 [2023-12-02 16:06:39,429 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-12-02 16:06:39,429 INFO L378 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 29 treesize of output 32 [2023-12-02 16:06:39,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:39,514 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 16:06:39,514 INFO L378 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-12-02 16:06:39,530 INFO L378 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-12-02 16:06:39,591 INFO L378 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-12-02 16:06:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:06:39,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:06:39,893 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25| Int) (v_ArrVal_1386 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_27| Int) (v_ArrVal_1392 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_27| 1) (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_27| v_ArrVal_1392) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_27|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_27| v_ArrVal_1386) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_27| 1)))) is different from false [2023-12-02 16:06:39,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916527291] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:39,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1072549312] [2023-12-02 16:06:39,897 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 16:06:39,897 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:06:39,898 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:06:39,898 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:06:39,898 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:06:40,795 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:06:40,810 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:06:45,909 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5375#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| Int) (|v_#memory_int_155| (Array Int (Array Int Int))) (|v_#memory_int_156| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| Int) (|v_#memory_$Pointer$.offset_188| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_200| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_156| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_int_156| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0)))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|)) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|)) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_188| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| (store (select |v_#memory_$Pointer$.offset_188| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select (store |v_#memory_$Pointer$.offset_188| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| (store (select |v_#memory_$Pointer$.offset_188| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) 1) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| 0))) (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27|) (= (store (store |v_#memory_$Pointer$.base_200| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| (store (select |v_#memory_$Pointer$.base_200| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select (store |v_#memory_$Pointer$.base_200| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| (store (select |v_#memory_$Pointer$.base_200| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0))) |#memory_$Pointer$.base|) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 1) (= (store |v_#memory_int_155| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| (store (select |v_#memory_int_155| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| (select (select |v_#memory_int_156| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27|))) |v_#memory_int_156|))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:06:45,909 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:06:45,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:06:45,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2023-12-02 16:06:45,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709627948] [2023-12-02 16:06:45,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:06:45,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 16:06:45,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:45,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 16:06:45,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3451, Unknown=17, NotChecked=118, Total=3782 [2023-12-02 16:06:45,912 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 35 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-02 16:06:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:47,782 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2023-12-02 16:06:47,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 16:06:47,782 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2023-12-02 16:06:47,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:47,783 INFO L225 Difference]: With dead ends: 151 [2023-12-02 16:06:47,783 INFO L226 Difference]: Without dead ends: 151 [2023-12-02 16:06:47,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=387, Invalid=5918, Unknown=19, NotChecked=156, Total=6480 [2023-12-02 16:06:47,786 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 294 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 1812 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:47,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 995 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1812 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 16:06:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-02 16:06:47,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 89. [2023-12-02 16:06:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.532258064516129) internal successors, (95), 84 states have internal predecessors, (95), 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-12-02 16:06:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2023-12-02 16:06:47,790 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 36 [2023-12-02 16:06:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:47,791 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2023-12-02 16:06:47,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-02 16:06:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2023-12-02 16:06:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 16:06:47,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:47,791 INFO L195 NwaCegarLoop]: trace histogram [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-12-02 16:06:47,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 16:06:47,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:47,992 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:47,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:47,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1667614349, now seen corresponding path program 1 times [2023-12-02 16:06:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:47,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946043300] [2023-12-02 16:06:47,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:06:49,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:49,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946043300] [2023-12-02 16:06:49,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946043300] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:49,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509795474] [2023-12-02 16:06:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:49,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:49,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:06:49,318 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:06:49,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 16:06:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:49,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 82 conjunts are in the unsatisfiable core [2023-12-02 16:06:49,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:06:49,527 INFO L378 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-12-02 16:06:49,826 INFO L378 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 28 treesize of output 16 [2023-12-02 16:06:49,829 INFO L378 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-12-02 16:06:49,832 INFO L378 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-12-02 16:06:49,835 INFO L378 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-12-02 16:06:49,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:49,942 INFO L378 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-12-02 16:06:49,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:49,947 INFO L378 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 36 treesize of output 27 [2023-12-02 16:06:49,961 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:06:49,962 INFO L378 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-12-02 16:06:49,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:49,976 INFO L378 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-12-02 16:06:50,304 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:06:50,305 INFO L378 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 59 treesize of output 52 [2023-12-02 16:06:50,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:50,312 INFO L378 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-12-02 16:06:50,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:50,371 INFO L378 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-12-02 16:06:50,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:06:50,377 INFO L378 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-12-02 16:06:50,436 INFO L378 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 26 treesize of output 14 [2023-12-02 16:06:50,440 INFO L378 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-12-02 16:06:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:06:50,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:06:50,535 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1539 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1538) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-02 16:06:51,034 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32| Int) (v_ArrVal_1548 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32| v_ArrVal_1548) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32|) 0)) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1537 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32| v_ArrVal_1549) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_1537) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32| v_ArrVal_1539) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32| 1)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32| Int) (v_ArrVal_1548 (Array Int Int))) (or (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1537 (Array Int Int)) (v_ArrVal_1536 (Array Int Int)) (v_ArrVal_1550 Int) (v_ArrVal_1539 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32| v_ArrVal_1549) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1537) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32| v_ArrVal_1539) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32| v_ArrVal_1550) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1536) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32| v_ArrVal_1538) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (< (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32| v_ArrVal_1548) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_32| 1))))) is different from false [2023-12-02 16:06:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509795474] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:51,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [92797726] [2023-12-02 16:06:51,039 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 16:06:51,039 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:06:51,039 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:06:51,039 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:06:51,040 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:06:51,963 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:06:51,979 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:06:57,502 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5859#(and (exists ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_34| Int) (|v_#memory_int_171| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34| Int) (|v_#memory_$Pointer$.base_222| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_210| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| Int)) (and (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34|) 1) (= (store (store |v_#memory_$Pointer$.base_222| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_$Pointer$.base_222| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_34| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34| (store (select (store |v_#memory_$Pointer$.base_222| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_$Pointer$.base_222| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_34| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34|) 0))) |#memory_$Pointer$.base|) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_210| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_$Pointer$.offset_210| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_34| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34| (store (select (store |v_#memory_$Pointer$.offset_210| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_$Pointer$.offset_210| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_34| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34|) 0)))) (= |#memory_int| (store |v_#memory_int_172| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34| (store (select |v_#memory_int_172| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34|) 0)))) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_34| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| 0))) (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_34|) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_34|)) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_34| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|)) (= (store |v_#memory_int_171| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_int_171| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_34| (select (select |v_#memory_int_172| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_34|))) |v_#memory_int_172|))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (or (< (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:06:57,502 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:06:57,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:06:57,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 33 [2023-12-02 16:06:57,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640782032] [2023-12-02 16:06:57,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:06:57,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 16:06:57,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:06:57,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 16:06:57,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3661, Unknown=9, NotChecked=246, Total=4160 [2023-12-02 16:06:57,505 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 34 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:06:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:06:59,035 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2023-12-02 16:06:59,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 16:06:59,035 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 4 states have call successors, (6), 2 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 36 [2023-12-02 16:06:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:06:59,036 INFO L225 Difference]: With dead ends: 146 [2023-12-02 16:06:59,037 INFO L226 Difference]: Without dead ends: 146 [2023-12-02 16:06:59,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=366, Invalid=4887, Unknown=11, NotChecked=286, Total=5550 [2023-12-02 16:06:59,039 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 254 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 16:06:59,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 658 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 16:06:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-02 16:06:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 91. [2023-12-02 16:06:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.515625) internal successors, (97), 86 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-12-02 16:06:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2023-12-02 16:06:59,044 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 36 [2023-12-02 16:06:59,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:06:59,044 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2023-12-02 16:06:59,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:06:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2023-12-02 16:06:59,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 16:06:59,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:06:59,045 INFO L195 NwaCegarLoop]: trace histogram [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-12-02 16:06:59,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-02 16:06:59,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:59,246 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:06:59,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:06:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1095913278, now seen corresponding path program 1 times [2023-12-02 16:06:59,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:06:59,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684891458] [2023-12-02 16:06:59,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:59,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:06:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:06:59,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:06:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684891458] [2023-12-02 16:06:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684891458] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971706179] [2023-12-02 16:06:59,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:06:59,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:06:59,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:06:59,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:06:59,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 16:06:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:06:59,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 16:06:59,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:06:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:06:59,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:06:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:06:59,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971706179] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:06:59,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1543170962] [2023-12-02 16:06:59,665 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 16:06:59,666 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:06:59,666 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:06:59,666 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:06:59,666 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:07:00,575 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:07:00,588 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:07:04,324 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6363#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_232| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_244| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_$Pointer$.base_244| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_244| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_232| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_$Pointer$.offset_232| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_232| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)))) (or (not (= (select (select |v_#memory_$Pointer$.offset_232| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) 0)) (not (= (select (select |v_#memory_$Pointer$.base_244| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) 0))))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) |ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset|) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= 5 |ULTIMATE.start_sll_circular_insert_~data#1|) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) |ULTIMATE.start_sll_circular_insert_#t~mem15#1.base|) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0) (or (< (select |#length| |ULTIMATE.start_sll_circular_insert_#t~mem15#1.base|) (+ 4 |ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset|)) (< |ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset| 0)) (exists ((|v_#memory_int_193| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_193| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_193| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))))) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (<= |ULTIMATE.start_sll_circular_insert_~index#1| 0) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 5) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:07:04,324 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:07:04,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:07:04,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-12-02 16:07:04,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170836767] [2023-12-02 16:07:04,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:07:04,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:07:04,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:07:04,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:07:04,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=879, Unknown=6, NotChecked=0, Total=992 [2023-12-02 16:07:04,326 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-12-02 16:07:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:07:04,477 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2023-12-02 16:07:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 16:07:04,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 37 [2023-12-02 16:07:04,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:07:04,478 INFO L225 Difference]: With dead ends: 85 [2023-12-02 16:07:04,478 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 16:07:04,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=127, Invalid=1055, Unknown=8, NotChecked=0, Total=1190 [2023-12-02 16:07:04,479 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:07:04,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 250 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:07:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 16:07:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-02 16:07:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.5) internal successors, (90), 80 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-12-02 16:07:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2023-12-02 16:07:04,482 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 37 [2023-12-02 16:07:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:07:04,483 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2023-12-02 16:07:04,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-12-02 16:07:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2023-12-02 16:07:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 16:07:04,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:07:04,483 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:07:04,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 16:07:04,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:07:04,684 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:07:04,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:07:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash 854316206, now seen corresponding path program 1 times [2023-12-02 16:07:04,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:07:04,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830433450] [2023-12-02 16:07:04,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:07:04,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:07:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:07:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 16:07:04,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:07:04,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830433450] [2023-12-02 16:07:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830433450] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:07:04,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:07:04,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 16:07:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278760713] [2023-12-02 16:07:04,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:07:04,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 16:07:04,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:07:04,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 16:07:04,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 16:07:04,870 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 9 states, 6 states have (on average 4.333333333333333) internal successors, (26), 8 states have internal predecessors, (26), 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-12-02 16:07:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:07:05,078 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2023-12-02 16:07:05,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 16:07:05,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.333333333333333) internal successors, (26), 8 states have internal predecessors, (26), 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 38 [2023-12-02 16:07:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:07:05,079 INFO L225 Difference]: With dead ends: 144 [2023-12-02 16:07:05,079 INFO L226 Difference]: Without dead ends: 144 [2023-12-02 16:07:05,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-02 16:07:05,080 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 83 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:07:05,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 412 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:07:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-02 16:07:05,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 86. [2023-12-02 16:07:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 81 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-12-02 16:07:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2023-12-02 16:07:05,084 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 38 [2023-12-02 16:07:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:07:05,084 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2023-12-02 16:07:05,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.333333333333333) internal successors, (26), 8 states have internal predecessors, (26), 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-12-02 16:07:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2023-12-02 16:07:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 16:07:05,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:07:05,085 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:07:05,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 16:07:05,085 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:07:05,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:07:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash 854316207, now seen corresponding path program 1 times [2023-12-02 16:07:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:07:05,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161320766] [2023-12-02 16:07:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:07:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:07:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:07:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 16:07:05,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:07:05,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161320766] [2023-12-02 16:07:05,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161320766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:07:05,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:07:05,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 16:07:05,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904853067] [2023-12-02 16:07:05,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:07:05,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 16:07:05,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:07:05,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 16:07:05,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 16:07:05,442 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 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-12-02 16:07:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:07:05,711 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2023-12-02 16:07:05,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 16:07:05,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 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 38 [2023-12-02 16:07:05,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:07:05,713 INFO L225 Difference]: With dead ends: 141 [2023-12-02 16:07:05,713 INFO L226 Difference]: Without dead ends: 141 [2023-12-02 16:07:05,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-02 16:07:05,713 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 74 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:07:05,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 635 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:07:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-02 16:07:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 83. [2023-12-02 16:07:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 78 states have internal predecessors, (88), 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-12-02 16:07:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2023-12-02 16:07:05,717 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 38 [2023-12-02 16:07:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:07:05,717 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2023-12-02 16:07:05,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 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-12-02 16:07:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2023-12-02 16:07:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 16:07:05,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:07:05,718 INFO L195 NwaCegarLoop]: trace histogram [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-12-02 16:07:05,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 16:07:05,718 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:07:05,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:07:05,718 INFO L85 PathProgramCache]: Analyzing trace with hash 384596727, now seen corresponding path program 1 times [2023-12-02 16:07:05,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:07:05,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252615604] [2023-12-02 16:07:05,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:07:05,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:07:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:07:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:07:07,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:07:07,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252615604] [2023-12-02 16:07:07,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252615604] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:07:07,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302508701] [2023-12-02 16:07:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:07:07,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:07:07,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:07:07,748 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:07:07,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 16:07:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:07:07,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 120 conjunts are in the unsatisfiable core [2023-12-02 16:07:07,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:07:07,969 INFO L378 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-12-02 16:07:08,174 INFO L378 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-12-02 16:07:08,230 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:07:08,231 INFO L378 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-12-02 16:07:08,363 INFO L378 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 23 treesize of output 11 [2023-12-02 16:07:08,460 INFO L378 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 20 treesize of output 15 [2023-12-02 16:07:08,550 INFO L378 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 30 treesize of output 18 [2023-12-02 16:07:08,554 INFO L378 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-12-02 16:07:08,557 INFO L378 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-12-02 16:07:08,560 INFO L378 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-12-02 16:07:08,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:07:08,701 INFO L378 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-12-02 16:07:08,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:07:08,716 INFO L378 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 38 treesize of output 29 [2023-12-02 16:07:08,733 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-02 16:07:08,733 INFO L378 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 23 [2023-12-02 16:07:08,752 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:07:08,753 INFO L378 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-12-02 16:07:09,207 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:07:09,207 INFO L378 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 88 treesize of output 75 [2023-12-02 16:07:09,212 INFO L378 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 39 treesize of output 15 [2023-12-02 16:07:09,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:07:09,220 INFO L378 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-12-02 16:07:09,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:07:09,312 INFO L378 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 37 treesize of output 28 [2023-12-02 16:07:09,317 INFO L378 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 20 treesize of output 15 [2023-12-02 16:07:09,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:07:09,322 INFO L378 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-12-02 16:07:09,414 INFO L378 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 28 treesize of output 16 [2023-12-02 16:07:09,418 INFO L378 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-12-02 16:07:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:07:09,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:07:09,619 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1962) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1963) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-12-02 16:07:10,317 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_39| Int) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_39| v_ArrVal_1973) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_39| v_ArrVal_1975) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_39|) 0)) (< .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse1 v_ArrVal_1959) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_39| v_ArrVal_1962) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1958) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_39| v_ArrVal_1961) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1960) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_39| v_ArrVal_1963) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_1959 (store (select (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_39| v_ArrVal_1974) .cse1) .cse0 (select v_ArrVal_1959 .cse0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_39| 1))))) is different from false [2023-12-02 16:07:10,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302508701] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:07:10,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1518636311] [2023-12-02 16:07:10,321 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 16:07:10,321 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:07:10,321 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:07:10,321 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:07:10,321 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:07:11,265 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:07:11,279 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:07:18,061 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7267#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| Int) (|v_#memory_int_217| (Array Int (Array Int Int))) (|v_#memory_int_218| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37| Int) (|v_#memory_$Pointer$.offset_253| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_265| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_43| Int)) (and (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|)) (= (store |v_#memory_int_217| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| (store (select |v_#memory_int_217| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_43| (select (select |v_#memory_int_218| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_43|))) |v_#memory_int_218|) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_43| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) 1) (= (store (store |v_#memory_$Pointer$.base_265| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| (store (select |v_#memory_$Pointer$.base_265| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_43| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37| (store (select (store |v_#memory_$Pointer$.base_265| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| (store (select |v_#memory_$Pointer$.base_265| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_43| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 0))) |#memory_$Pointer$.base|) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_43| 0))) (= (store (store |v_#memory_$Pointer$.offset_253| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| (store (select |v_#memory_$Pointer$.offset_253| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_43| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37| (store (select (store |v_#memory_$Pointer$.offset_253| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| (store (select |v_#memory_$Pointer$.offset_253| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_43| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 0))) |#memory_$Pointer$.offset|) (= |#memory_int| (store |v_#memory_int_218| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37| (store (select |v_#memory_int_218| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 0)))) (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_43|) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 1))) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:07:18,061 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:07:18,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:07:18,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 47 [2023-12-02 16:07:18,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912623215] [2023-12-02 16:07:18,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:07:18,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-02 16:07:18,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:07:18,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-02 16:07:18,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=5565, Unknown=12, NotChecked=302, Total=6162 [2023-12-02 16:07:18,065 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 47 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 38 states have internal predecessors, (60), 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-12-02 16:07:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:07:19,884 INFO L93 Difference]: Finished difference Result 156 states and 179 transitions. [2023-12-02 16:07:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 16:07:19,885 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 38 states have internal predecessors, (60), 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 40 [2023-12-02 16:07:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:07:19,886 INFO L225 Difference]: With dead ends: 156 [2023-12-02 16:07:19,886 INFO L226 Difference]: Without dead ends: 156 [2023-12-02 16:07:19,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2120 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=404, Invalid=7423, Unknown=13, NotChecked=350, Total=8190 [2023-12-02 16:07:19,889 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 168 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:07:19,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1154 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 16:07:19,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-02 16:07:19,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 101. [2023-12-02 16:07:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 94 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 16:07:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2023-12-02 16:07:19,894 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 40 [2023-12-02 16:07:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:07:19,894 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2023-12-02 16:07:19,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 38 states have internal predecessors, (60), 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-12-02 16:07:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2023-12-02 16:07:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 16:07:19,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:07:19,894 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:07:19,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 16:07:20,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:07:20,095 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:07:20,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:07:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash -959259051, now seen corresponding path program 1 times [2023-12-02 16:07:20,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:07:20,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760855041] [2023-12-02 16:07:20,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:07:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:07:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:07:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:07:20,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:07:20,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760855041] [2023-12-02 16:07:20,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760855041] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:07:20,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648643679] [2023-12-02 16:07:20,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:07:20,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:07:20,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:07:20,905 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:07:20,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 16:07:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:07:21,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 16:07:21,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:07:21,306 INFO L378 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-12-02 16:07:21,309 INFO L378 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-12-02 16:07:21,363 INFO L378 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 8 treesize of output 1 [2023-12-02 16:07:21,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:07:21,398 INFO L378 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-12-02 16:07:21,406 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:07:21,407 INFO L378 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-12-02 16:07:21,671 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-02 16:07:21,671 INFO L378 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 57 treesize of output 39 [2023-12-02 16:07:21,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:07:21,678 INFO L378 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 32 treesize of output 19 [2023-12-02 16:07:21,759 INFO L349 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-12-02 16:07:21,759 INFO L378 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 128 treesize of output 99 [2023-12-02 16:07:21,769 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-12-02 16:07:21,770 INFO L378 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 84 [2023-12-02 16:07:21,834 INFO L378 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 62 treesize of output 46 [2023-12-02 16:07:21,933 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 16:07:21,933 INFO L378 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 63 treesize of output 26 [2023-12-02 16:07:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:07:21,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:07:21,956 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2023-12-02 16:07:21,956 INFO L378 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 33 treesize of output 32 [2023-12-02 16:07:22,061 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2117 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2118))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2117) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2119) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-02 16:07:22,080 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2117 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2118))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2117) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2119) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-12-02 16:07:22,091 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2117 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2118))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2117) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2119) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-12-02 16:07:22,102 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2117 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2118))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2117) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2119) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) is different from false [2023-12-02 16:07:22,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:07:22,168 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 688 treesize of output 659 [2023-12-02 16:07:22,177 INFO L378 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 648 treesize of output 640 [2023-12-02 16:07:22,184 INFO L378 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 640 treesize of output 624 [2023-12-02 16:07:22,193 INFO L378 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 313 treesize of output 309 [2023-12-02 16:07:27,180 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (.cse20 (< |c_#StackHeapBarrier| (+ 1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (.cse0 (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_sll_circular_insert_~head#1.base| 1))) (.cse1 (not (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) 0))) (.cse155 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse369 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse369 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (let ((.cse370 (store (store |c_#memory_$Pointer$.base| .cse369 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse369) v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse370 (select (select .cse370 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (.cse26 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse156 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse366 (let ((.cse367 (store (let ((.cse368 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse368 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse368) v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse367 (select (select .cse367 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse366 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse366 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))) (let ((.cse2 (or .cse26 .cse156)) (.cse18 (or .cse26 .cse155)) (.cse88 (forall ((v_arrayElimCell_96 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse365 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse364 (select (select .cse365 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (let ((.cse363 (store (store |c_#memory_$Pointer$.base| .cse364 (store (select .cse365 .cse364) v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse363 (select (select .cse363 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= .cse364 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse89 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse359 (let ((.cse360 (store (let ((.cse362 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse361 (select (select .cse362 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse361 (store (select .cse362 .cse361) v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse360 (select (select .cse360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse359 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse359 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse90 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse358 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse355 (select (select .cse358 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse356 (select .cse358 .cse355))) (let ((.cse353 (let ((.cse357 (store (store |c_#memory_$Pointer$.base| .cse355 (store .cse356 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse357 (select (select .cse357 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse353 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse354 (store (store |c_#memory_$Pointer$.base| .cse355 (store .cse356 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse354 (select (select .cse354 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)) (= (select .cse353 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse99 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse352 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse349 (select (select .cse352 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse350 (select .cse352 .cse349)) (.cse351 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse348 (select (store (store |c_#memory_$Pointer$.base| .cse349 (store .cse350 v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse351))) (or (= (select .cse348 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse348 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse349 (store .cse350 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse351) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (.cse118 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse345 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse346 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse345))) (let ((.cse343 (let ((.cse347 (store (store |c_#memory_$Pointer$.base| .cse345 (store .cse346 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse347 (select (select .cse347 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse343 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse343 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse344 (store (store |c_#memory_$Pointer$.base| .cse345 (store .cse346 v_arrayElimCell_96 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse344 (select (select .cse344 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))) (.cse91 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse342 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse338 (select (select .cse342 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse340 (select .cse342 .cse338))) (let ((.cse337 (let ((.cse341 (store (store |c_#memory_$Pointer$.base| .cse338 (store .cse340 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse341 (select (select .cse341 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse337 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= .cse338 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse337 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select (let ((.cse339 (store (store |c_#memory_$Pointer$.base| .cse338 (store .cse340 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse339 (select (select .cse339 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse92 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse333 (let ((.cse334 (store (let ((.cse336 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse335 (select (select .cse336 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse335 (store (select .cse336 .cse335) v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse334 (select (select .cse334 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse333 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse333 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse333 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse93 (forall ((v_arrayElimCell_96 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse332 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse327 (select (select .cse332 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse327 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse330 (select .cse332 .cse327))) (let ((.cse328 (let ((.cse331 (store (store |c_#memory_$Pointer$.base| .cse327 (store .cse330 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse331 (select (select .cse331 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse328 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse329 (store (store |c_#memory_$Pointer$.base| .cse327 (store .cse330 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse329 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)) (forall ((v_arrayElimCell_98 Int)) (= (select .cse328 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse100 (or .cse0 .cse1 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse324 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse325 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse324))) (let ((.cse321 (let ((.cse326 (store (store |c_#memory_$Pointer$.base| .cse324 (store .cse325 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse326 (select (select .cse326 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse322 (let ((.cse323 (store (store |c_#memory_$Pointer$.base| .cse324 (store .cse325 v_arrayElimCell_96 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse323 (select (select .cse323 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse321 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse321 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse321 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse322 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse322 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))))) (.cse121 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse318 (select (store (let ((.cse320 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse319 (select (select .cse320 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse319 (store (select .cse320 .cse319) v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)))) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse318 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse318 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|))))) (.cse101 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse317 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse314 (select (select .cse317 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse314 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse315 (let ((.cse316 (store (store |c_#memory_$Pointer$.base| .cse314 (store (select .cse317 .cse314) v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse316 (select (select .cse316 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse315 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse315 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse110 (or .cse0 .cse1 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse311 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse312 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse311))) (let ((.cse309 (let ((.cse313 (store (store |c_#memory_$Pointer$.base| .cse311 (store .cse312 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse313 (select (select .cse313 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse309 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse309 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse310 (store (store |c_#memory_$Pointer$.base| .cse311 (store .cse312 v_arrayElimCell_96 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse310 (select (select .cse310 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= .cse311 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (.cse102 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse308 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse307 (select (select .cse308 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| .cse307 (store (select .cse308 .cse307) v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse307 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (.cse111 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse306 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse303 (select (select .cse306 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse304 (select .cse306 .cse303))) (let ((.cse301 (let ((.cse305 (store (store |c_#memory_$Pointer$.base| .cse303 (store .cse304 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse305 (select (select .cse305 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse300 (let ((.cse302 (store (store |c_#memory_$Pointer$.base| .cse303 (store .cse304 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse302 (select (select .cse302 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse300 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse301 v_arrayElimCell_100)) (= (select .cse301 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse300 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse94 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse299 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse296 (select (select .cse299 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse297 (select .cse299 .cse296)) (.cse298 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse295 (select (store (store |c_#memory_$Pointer$.base| .cse296 (store .cse297 v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse298))) (or (forall ((v_arrayElimCell_99 Int)) (let ((.cse294 (select (store (store |c_#memory_$Pointer$.base| .cse296 (store .cse297 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse298))) (or (= (select .cse294 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_98 Int)) (or (= (select .cse295 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse294 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (= (select .cse295 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (.cse95 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse293 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse290 (select (select .cse293 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse291 (select .cse293 .cse290)) (.cse292 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse289 (select (store (store |c_#memory_$Pointer$.base| .cse290 (store .cse291 v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse292))) (or (= (select .cse289 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse290 (store .cse291 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse292) v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse289 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (.cse112 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse288 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse282 (select (select .cse288 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse282 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse286 (select .cse288 .cse282))) (let ((.cse283 (let ((.cse287 (store (store |c_#memory_$Pointer$.base| .cse282 (store .cse286 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse287 (select (select .cse287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse284 (let ((.cse285 (store (store |c_#memory_$Pointer$.base| .cse282 (store .cse286 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse285 (select (select .cse285 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse283 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse284 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse283 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse284 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse113 (forall ((v_arrayElimCell_96 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse281 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse278 (select (select .cse281 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse279 (select .cse281 .cse278))) (or (= (select (let ((.cse277 (store (store |c_#memory_$Pointer$.base| .cse278 (store .cse279 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse277 (select (select .cse277 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse280 (store (store |c_#memory_$Pointer$.base| .cse278 (store .cse279 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse280 (select (select .cse280 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)) (not (= .cse278 |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse114 (forall ((v_arrayElimCell_96 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse276 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse275 (select (select .cse276 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse273 (let ((.cse274 (store (store |c_#memory_$Pointer$.base| .cse275 (store (select .cse276 .cse275) v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse274 (select (select .cse274 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse273 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_arrayElimCell_98 Int)) (= (select .cse273 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))) (not (= .cse275 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse103 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2126 (Array Int Int))) (let ((.cse269 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse269 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse271 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse269))) (or (= (select (let ((.cse270 (store (store |c_#memory_$Pointer$.base| .cse269 (store .cse271 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse270 (select (select .cse270 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (forall ((v_arrayElimCell_98 Int)) (= (select (let ((.cse272 (store (store |c_#memory_$Pointer$.base| .cse269 (store .cse271 v_arrayElimCell_96 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse272 (select (select .cse272 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))))) (.cse104 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse266 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse267 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse266))) (let ((.cse264 (let ((.cse268 (store (store |c_#memory_$Pointer$.base| .cse266 (store .cse267 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse268 (select (select .cse268 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_98 Int)) (or (= (select .cse264 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse265 (store (store |c_#memory_$Pointer$.base| .cse266 (store .cse267 v_arrayElimCell_96 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse265 (select (select .cse265 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) (= (select .cse264 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse264 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))) (.cse115 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse263 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse260 (select (select .cse263 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse261 (select .cse263 .cse260))) (let ((.cse258 (let ((.cse262 (store (store |c_#memory_$Pointer$.base| .cse260 (store .cse261 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse262 (select (select .cse262 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse257 (let ((.cse259 (store (store |c_#memory_$Pointer$.base| .cse260 (store .cse261 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse259 (select (select .cse259 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse257 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse257 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse258 v_arrayElimCell_100)) (= (select .cse258 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse257 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse116 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse256 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse253 (select (select .cse256 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse254 (select .cse256 .cse253))) (let ((.cse250 (let ((.cse255 (store (store |c_#memory_$Pointer$.base| .cse253 (store .cse254 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse255 (select (select .cse255 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse250 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_arrayElimCell_99 Int)) (let ((.cse251 (let ((.cse252 (store (store |c_#memory_$Pointer$.base| .cse253 (store .cse254 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse252 (select (select .cse252 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse251 v_arrayElimCell_100)) (forall ((v_arrayElimCell_98 Int)) (or (= (select .cse250 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse251 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))) (= (select .cse250 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse117 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse249 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse245 (select (select .cse249 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse245 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse247 (select .cse249 .cse245))) (or (= (select (let ((.cse246 (store (store |c_#memory_$Pointer$.base| .cse245 (store .cse247 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse246 (select (select .cse246 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select (let ((.cse248 (store (store |c_#memory_$Pointer$.base| .cse245 (store .cse247 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse248 (select (select .cse248 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse96 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int)) (= (select (select (store (let ((.cse244 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse243 (select (select .cse244 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse243 (store (select .cse244 .cse243) v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)))) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))) (.cse97 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse242 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse239 (select (select .cse242 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse240 (select .cse242 .cse239)) (.cse241 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| .cse239 (store .cse240 v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse241) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse239 (store .cse240 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse241) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (.cse98 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse238 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse237 (select (select .cse238 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_98 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse237 (store (select .cse238 .cse237) v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse237 |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (.cse119 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse236 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse233 (select (select .cse236 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse234 (select .cse236 .cse233))) (let ((.cse231 (let ((.cse235 (store (store |c_#memory_$Pointer$.base| .cse233 (store .cse234 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse235 (select (select .cse235 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse231 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse231 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse231 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select (let ((.cse232 (store (store |c_#memory_$Pointer$.base| .cse233 (store .cse234 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse232 (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse52 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse230 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (let ((.cse229 (store (store |c_#memory_$Pointer$.base| .cse230 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse230) v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse229 (select (select .cse229 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= .cse230 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (.cse120 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse228 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse226 (select (select .cse228 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse226 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (let ((.cse227 (store (store |c_#memory_$Pointer$.base| .cse226 (store (select .cse228 .cse226) v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse227 (select (select .cse227 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse122 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse225 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse222 (select (select .cse225 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse223 (select .cse225 .cse222))) (let ((.cse220 (let ((.cse224 (store (store |c_#memory_$Pointer$.base| .cse222 (store .cse223 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse224 (select (select .cse224 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (or (= (select .cse220 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse221 (store (store |c_#memory_$Pointer$.base| .cse222 (store .cse223 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse221 (select (select .cse221 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)))) (= (select .cse220 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_arrayElimCell_98 Int)) (= (select .cse220 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))))))) (.cse123 (or (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse219 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse216 (select (select .cse219 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse217 (select .cse219 .cse216)) (.cse218 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| .cse216 (store .cse217 v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse218) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse216 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse216 (store .cse217 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse218) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) .cse19 .cse20)) (.cse124 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse215 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse212 (select (select .cse215 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse213 (select .cse215 .cse212))) (let ((.cse209 (let ((.cse214 (store (store |c_#memory_$Pointer$.base| .cse212 (store .cse213 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse214 (select (select .cse214 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse210 (let ((.cse211 (store (store |c_#memory_$Pointer$.base| .cse212 (store .cse213 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse211 (select (select .cse211 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse209 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse209 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse210 v_arrayElimCell_100)) (= (select .cse210 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse209 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse210 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse17 (not .cse26))) (and (or .cse0 .cse1 (and .cse2 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse5 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse5))) (let ((.cse3 (let ((.cse7 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse3 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (forall ((v_arrayElimCell_98 Int)) (or (= (select .cse3 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 v_arrayElimCell_97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) (= (select .cse3 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))) (forall ((v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_97 Int)) (let ((.cse8 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse10 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse8))) (or (forall ((v_arrayElimCell_98 Int)) (= (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| .cse8 (store .cse10 v_arrayElimCell_97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| .cse8 (store .cse10 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse14 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse15 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse14))) (let ((.cse12 (let ((.cse16 (store (store |c_#memory_$Pointer$.base| .cse14 (store .cse15 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse12 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| .cse14 (store .cse15 v_arrayElimCell_97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse12 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))) .cse17) .cse18)) (or .cse19 .cse20 (and (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse23 (select .cse25 .cse22)) (.cse24 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (select (store (store |c_#memory_$Pointer$.base| .cse22 (store .cse23 v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse24))) (or (= (select .cse21 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse22 (store .cse23 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse24) v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse21 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) .cse26) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int)) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse30 (select .cse32 .cse29)) (.cse31 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (select (store (store |c_#memory_$Pointer$.base| .cse29 (store .cse30 v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse31))) (or (= (select .cse27 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_99 Int)) (let ((.cse28 (select (store (store |c_#memory_$Pointer$.base| .cse29 (store .cse30 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse31))) (or (forall ((v_arrayElimCell_98 Int)) (or (= (select .cse27 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse28 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))) (= (select .cse28 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|)))))))))))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse36 (select (select .cse39 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse37 (select .cse39 .cse36))) (let ((.cse34 (let ((.cse38 (store (store |c_#memory_$Pointer$.base| .cse36 (store .cse37 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse38 (select (select .cse38 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_arrayElimCell_99 Int)) (let ((.cse33 (let ((.cse35 (store (store |c_#memory_$Pointer$.base| .cse36 (store .cse37 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse35 (select (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse33 v_arrayElimCell_100)) (forall ((v_arrayElimCell_98 Int)) (or (= (select .cse34 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse33 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))) (= (select .cse34 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))) (= (select .cse34 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or .cse0 .cse1 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse42 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse43 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse42))) (let ((.cse40 (let ((.cse44 (store (store |c_#memory_$Pointer$.base| .cse42 (store .cse43 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse44 (select (select .cse44 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse40 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse41 (store (store |c_#memory_$Pointer$.base| .cse42 (store .cse43 v_arrayElimCell_97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse40 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= .cse42 |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse51 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse48 (select (select .cse51 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse49 (select .cse51 .cse48))) (let ((.cse45 (let ((.cse50 (store (store |c_#memory_$Pointer$.base| .cse48 (store .cse49 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse50 (select (select .cse50 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse46 (let ((.cse47 (store (store |c_#memory_$Pointer$.base| .cse48 (store .cse49 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse45 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse45 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse45 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse46 v_arrayElimCell_100)) (= (select .cse46 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))))) (or .cse52 .cse0 .cse26 .cse1) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse59 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse56 (select (select .cse59 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse57 (select .cse59 .cse56))) (let ((.cse53 (let ((.cse58 (store (store |c_#memory_$Pointer$.base| .cse56 (store .cse57 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse58 (select (select .cse58 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse54 (let ((.cse55 (store (store |c_#memory_$Pointer$.base| .cse56 (store .cse57 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse55 (select (select .cse55 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse53 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse53 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse53 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse54 v_arrayElimCell_100)) (= (select .cse54 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse54 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse63 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse60 (select (select .cse63 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse60 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse61 (let ((.cse62 (store (store |c_#memory_$Pointer$.base| .cse60 (store (select .cse63 .cse60) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse62 (select (select .cse62 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse61 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse61 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse69 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse66 (select (select .cse69 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse67 (select .cse69 .cse66))) (let ((.cse64 (let ((.cse68 (store (store |c_#memory_$Pointer$.base| .cse66 (store .cse67 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse68 (select (select .cse68 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse64 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse64 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse64 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select (let ((.cse65 (store (store |c_#memory_$Pointer$.base| .cse66 (store .cse67 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse65 (select (select .cse65 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse76 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse73 (select (select .cse76 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse74 (select .cse76 .cse73))) (let ((.cse70 (let ((.cse75 (store (store |c_#memory_$Pointer$.base| .cse73 (store .cse74 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse75 (select (select .cse75 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse71 (let ((.cse72 (store (store |c_#memory_$Pointer$.base| .cse73 (store .cse74 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse72 (select (select .cse72 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse70 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse70 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse71 v_arrayElimCell_100)) (= (select .cse71 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse77 (let ((.cse78 (store (let ((.cse80 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse79 (select (select .cse80 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse79 (store (select .cse80 .cse79) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse78 (select (select .cse78 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse77 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse77 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse77 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or .cse19 .cse20 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse81 (select (select .cse84 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse82 (select .cse84 .cse81)) (.cse83 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse81 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse81 (store .cse82 v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse83) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse81 (store .cse82 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse83) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse87 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse86 (select (select .cse87 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (let ((.cse85 (store (store |c_#memory_$Pointer$.base| .cse86 (store (select .cse87 .cse86) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse85 (select (select .cse85 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= .cse86 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (and .cse88 .cse89 .cse90 .cse91 .cse92 .cse93 (or .cse19 .cse20 (and .cse94 (or .cse26 .cse95))) (or (and (or .cse96 .cse26) .cse97 .cse98) .cse19 .cse20) (or .cse19 .cse20 .cse26 .cse99) .cse100 .cse101 (or .cse19 .cse20 .cse26 .cse102) (or .cse0 .cse1 (and .cse103 .cse2 .cse18 .cse104 (or .cse17 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse107 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse108 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse107))) (let ((.cse105 (let ((.cse109 (store (store |c_#memory_$Pointer$.base| .cse107 (store .cse108 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse109 (select (select .cse109 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse105 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse105 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse106 (store (store |c_#memory_$Pointer$.base| .cse107 (store .cse108 v_arrayElimCell_96 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse106 (select (select .cse106 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))))) .cse110 .cse111 .cse112 .cse113 .cse114 .cse115 .cse116 .cse117 (or .cse0 .cse118 .cse26 .cse1) .cse119 .cse120 (or .cse19 .cse121 .cse20 .cse26) .cse122 .cse123 .cse124)) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse127 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse125 (select (select .cse127 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse125 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int))) (= (select (let ((.cse126 (store (store |c_#memory_$Pointer$.base| .cse125 (store (select .cse127 .cse125) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse126 (select (select .cse126 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse131 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse130 (select (select .cse131 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse128 (let ((.cse129 (store (store |c_#memory_$Pointer$.base| .cse130 (store (select .cse131 .cse130) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse129 (select (select .cse129 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse128 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_arrayElimCell_98 Int)) (= (select .cse128 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))) (not (= .cse130 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or .cse0 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse133 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse134 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse133))) (let ((.cse135 (let ((.cse136 (store (store |c_#memory_$Pointer$.base| .cse133 (store .cse134 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse136 (select (select .cse136 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select (let ((.cse132 (store (store |c_#memory_$Pointer$.base| .cse133 (store .cse134 v_arrayElimCell_97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse132 (select (select .cse132 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse135 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse135 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))) .cse26 .cse1) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse137 (let ((.cse138 (store (let ((.cse140 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse139 (select (select .cse140 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse139 (store (select .cse140 .cse139) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse138 (select (select .cse138 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse137 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse137 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse145 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse142 (select (select .cse145 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse143 (select .cse145 .cse142))) (or (= (select (let ((.cse141 (store (store |c_#memory_$Pointer$.base| .cse142 (store .cse143 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse141 (select (select .cse141 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse144 (store (store |c_#memory_$Pointer$.base| .cse142 (store .cse143 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse144 (select (select .cse144 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)) (not (= .cse142 |c_ULTIMATE.start_main_~#s~0#1.base|))))))))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse150 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse147 (select (select .cse150 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse148 (select .cse150 .cse147)) (.cse149 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse146 (select (store (store |c_#memory_$Pointer$.base| .cse147 (store .cse148 v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse149))) (or (= (select .cse146 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse146 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse147 (store .cse148 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse149) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) .cse19 .cse20 .cse26) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse154 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse151 (select (select .cse154 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse152 (let ((.cse153 (store (store |c_#memory_$Pointer$.base| .cse151 (store (select .cse154 .cse151) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse153 (select (select .cse153 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse151 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse152 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse152 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or (and .cse88 .cse89 .cse90 (or .cse19 .cse20 .cse99) (or .cse0 .cse118 .cse1) .cse91 .cse92 .cse93 .cse100 (or .cse19 .cse121 .cse20) .cse101 .cse110 (or .cse19 .cse20 .cse102) .cse111 (or .cse19 .cse20 (and .cse94 .cse95)) .cse112 .cse113 .cse114 (or (and .cse103 .cse104 .cse155 .cse156) .cse0 .cse1) .cse115 .cse116 .cse117 (or .cse19 (and .cse96 .cse97 .cse98) .cse20) (or .cse0 .cse1 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse158 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse157 (let ((.cse159 (store (store |c_#memory_$Pointer$.base| .cse158 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse158) v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse159 (select (select .cse159 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse157 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse157 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= .cse158 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) .cse119 (or .cse52 .cse0 .cse1) .cse120 .cse122 .cse123 .cse124) .cse26) (or .cse19 .cse20 .cse26 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (let ((.cse160 (select (store (let ((.cse162 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse161 (select (select .cse162 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse161 (store (select .cse162 .cse161) v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)))) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse160 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse160 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse166 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse163 (select (select .cse166 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse163 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse164 (let ((.cse165 (store (store |c_#memory_$Pointer$.base| .cse163 (store (select .cse166 .cse163) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse165 (select (select .cse165 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse164 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse164 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or (and (forall ((v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_97 Int)) (let ((.cse169 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse167 (let ((.cse168 (store (store |c_#memory_$Pointer$.base| .cse169 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse169) v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse168 (select (select .cse168 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse167 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse167 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))) (= .cse169 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or .cse17 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse171 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (let ((.cse170 (store (store |c_#memory_$Pointer$.base| .cse171 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse171) v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse170 (select (select .cse170 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= .cse171 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) .cse0 .cse1) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse177 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse174 (select (select .cse177 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse175 (select .cse177 .cse174))) (let ((.cse172 (let ((.cse176 (store (store |c_#memory_$Pointer$.base| .cse174 (store .cse175 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse176 (select (select .cse176 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (or (= (select .cse172 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse173 (store (store |c_#memory_$Pointer$.base| .cse174 (store .cse175 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse173 (select (select .cse173 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)))) (= (select .cse172 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_arrayElimCell_98 Int)) (= (select .cse172 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or .cse0 .cse1 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse181 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse182 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse181))) (let ((.cse179 (let ((.cse183 (store (store |c_#memory_$Pointer$.base| .cse181 (store .cse182 v_arrayElimCell_97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse183 (select (select .cse183 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse178 (let ((.cse180 (store (store |c_#memory_$Pointer$.base| .cse181 (store .cse182 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse180 (select (select .cse180 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse178 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse179 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse179 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse178 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse178 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (let ((.cse185 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse184 (select (select .cse185 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse184 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse184 (store (select .cse185 .cse184) v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse19 .cse20 .cse26) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse188 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse186 (select (select .cse188 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse186 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (let ((.cse187 (store (store |c_#memory_$Pointer$.base| .cse186 (store (select .cse188 .cse186) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse187 (select (select .cse187 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse194 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse191 (select (select .cse194 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse192 (select .cse194 .cse191))) (let ((.cse189 (let ((.cse193 (store (store |c_#memory_$Pointer$.base| .cse191 (store .cse192 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse193 (select (select .cse193 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse189 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse189 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse190 (store (store |c_#memory_$Pointer$.base| .cse191 (store .cse192 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse190 (select (select .cse190 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or .cse19 .cse20 (and (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_97 Int)) (let ((.cse196 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse195 (select (select .cse196 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_98 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse195 (store (select .cse196 .cse195) v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse195 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (or .cse26 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (= (select (select (store (let ((.cse198 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse197 (select (select .cse198 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse197 (store (select .cse198 .cse197) v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)))) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse202 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse199 (select (select .cse202 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse200 (select .cse202 .cse199)) (.cse201 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| .cse199 (store .cse200 v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse201) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse199 (store .cse200 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse201) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse208 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse205 (select (select .cse208 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse206 (select .cse208 .cse205))) (let ((.cse203 (let ((.cse207 (store (store |c_#memory_$Pointer$.base| .cse205 (store .cse206 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse207 (select (select .cse207 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse203 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse204 (store (store |c_#memory_$Pointer$.base| .cse205 (store .cse206 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse204 (select (select .cse204 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)) (forall ((v_arrayElimCell_98 Int)) (= (select .cse203 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))) (not (= .cse205 |c_ULTIMATE.start_main_~#s~0#1.base|))))))))))) is different from false [2023-12-02 16:07:29,272 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse19 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (.cse20 (< |c_#StackHeapBarrier| (+ 1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (.cse0 (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_sll_circular_insert_~head#1.base| 1))) (.cse1 (not (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) 0))) (.cse155 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse369 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse369 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (let ((.cse370 (store (store |c_#memory_$Pointer$.base| .cse369 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse369) v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse370 (select (select .cse370 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (.cse26 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse156 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse366 (let ((.cse367 (store (let ((.cse368 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse368 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse368) v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse367 (select (select .cse367 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse366 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse366 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))) (let ((.cse2 (or .cse26 .cse156)) (.cse18 (or .cse26 .cse155)) (.cse88 (forall ((v_arrayElimCell_96 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse365 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse364 (select (select .cse365 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (let ((.cse363 (store (store |c_#memory_$Pointer$.base| .cse364 (store (select .cse365 .cse364) v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse363 (select (select .cse363 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= .cse364 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse89 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse359 (let ((.cse360 (store (let ((.cse362 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse361 (select (select .cse362 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse361 (store (select .cse362 .cse361) v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse360 (select (select .cse360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse359 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse359 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse90 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse358 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse355 (select (select .cse358 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse356 (select .cse358 .cse355))) (let ((.cse353 (let ((.cse357 (store (store |c_#memory_$Pointer$.base| .cse355 (store .cse356 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse357 (select (select .cse357 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse353 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse354 (store (store |c_#memory_$Pointer$.base| .cse355 (store .cse356 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse354 (select (select .cse354 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)) (= (select .cse353 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse99 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse352 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse349 (select (select .cse352 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse350 (select .cse352 .cse349)) (.cse351 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse348 (select (store (store |c_#memory_$Pointer$.base| .cse349 (store .cse350 v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse351))) (or (= (select .cse348 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse348 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse349 (store .cse350 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse351) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (.cse118 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse345 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse346 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse345))) (let ((.cse343 (let ((.cse347 (store (store |c_#memory_$Pointer$.base| .cse345 (store .cse346 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse347 (select (select .cse347 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse343 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse343 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse344 (store (store |c_#memory_$Pointer$.base| .cse345 (store .cse346 v_arrayElimCell_96 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse344 (select (select .cse344 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))) (.cse91 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse342 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse338 (select (select .cse342 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse340 (select .cse342 .cse338))) (let ((.cse337 (let ((.cse341 (store (store |c_#memory_$Pointer$.base| .cse338 (store .cse340 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse341 (select (select .cse341 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse337 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= .cse338 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse337 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select (let ((.cse339 (store (store |c_#memory_$Pointer$.base| .cse338 (store .cse340 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse339 (select (select .cse339 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse92 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse333 (let ((.cse334 (store (let ((.cse336 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse335 (select (select .cse336 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse335 (store (select .cse336 .cse335) v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse334 (select (select .cse334 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse333 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse333 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse333 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse93 (forall ((v_arrayElimCell_96 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse332 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse327 (select (select .cse332 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse327 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse330 (select .cse332 .cse327))) (let ((.cse328 (let ((.cse331 (store (store |c_#memory_$Pointer$.base| .cse327 (store .cse330 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse331 (select (select .cse331 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse328 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse329 (store (store |c_#memory_$Pointer$.base| .cse327 (store .cse330 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse329 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)) (forall ((v_arrayElimCell_98 Int)) (= (select .cse328 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse100 (or .cse0 .cse1 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse324 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse325 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse324))) (let ((.cse321 (let ((.cse326 (store (store |c_#memory_$Pointer$.base| .cse324 (store .cse325 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse326 (select (select .cse326 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse322 (let ((.cse323 (store (store |c_#memory_$Pointer$.base| .cse324 (store .cse325 v_arrayElimCell_96 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse323 (select (select .cse323 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse321 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse321 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse321 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse322 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse322 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))))) (.cse121 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse318 (select (store (let ((.cse320 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse319 (select (select .cse320 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse319 (store (select .cse320 .cse319) v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)))) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse318 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse318 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|))))) (.cse101 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse317 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse314 (select (select .cse317 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse314 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse315 (let ((.cse316 (store (store |c_#memory_$Pointer$.base| .cse314 (store (select .cse317 .cse314) v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse316 (select (select .cse316 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse315 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse315 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse110 (or .cse0 .cse1 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse311 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse312 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse311))) (let ((.cse309 (let ((.cse313 (store (store |c_#memory_$Pointer$.base| .cse311 (store .cse312 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse313 (select (select .cse313 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse309 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse309 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse310 (store (store |c_#memory_$Pointer$.base| .cse311 (store .cse312 v_arrayElimCell_96 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse310 (select (select .cse310 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= .cse311 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (.cse102 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse308 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse307 (select (select .cse308 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| .cse307 (store (select .cse308 .cse307) v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse307 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (.cse111 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse306 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse303 (select (select .cse306 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse304 (select .cse306 .cse303))) (let ((.cse301 (let ((.cse305 (store (store |c_#memory_$Pointer$.base| .cse303 (store .cse304 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse305 (select (select .cse305 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse300 (let ((.cse302 (store (store |c_#memory_$Pointer$.base| .cse303 (store .cse304 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse302 (select (select .cse302 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse300 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse301 v_arrayElimCell_100)) (= (select .cse301 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse300 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse94 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse299 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse296 (select (select .cse299 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse297 (select .cse299 .cse296)) (.cse298 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse295 (select (store (store |c_#memory_$Pointer$.base| .cse296 (store .cse297 v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse298))) (or (forall ((v_arrayElimCell_99 Int)) (let ((.cse294 (select (store (store |c_#memory_$Pointer$.base| .cse296 (store .cse297 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse298))) (or (= (select .cse294 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_98 Int)) (or (= (select .cse295 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse294 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (= (select .cse295 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (.cse95 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse293 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse290 (select (select .cse293 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse291 (select .cse293 .cse290)) (.cse292 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse289 (select (store (store |c_#memory_$Pointer$.base| .cse290 (store .cse291 v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse292))) (or (= (select .cse289 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse290 (store .cse291 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse292) v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse289 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (.cse112 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse288 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse282 (select (select .cse288 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse282 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse286 (select .cse288 .cse282))) (let ((.cse283 (let ((.cse287 (store (store |c_#memory_$Pointer$.base| .cse282 (store .cse286 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse287 (select (select .cse287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse284 (let ((.cse285 (store (store |c_#memory_$Pointer$.base| .cse282 (store .cse286 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse285 (select (select .cse285 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse283 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse284 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse283 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse284 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse113 (forall ((v_arrayElimCell_96 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse281 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse278 (select (select .cse281 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse279 (select .cse281 .cse278))) (or (= (select (let ((.cse277 (store (store |c_#memory_$Pointer$.base| .cse278 (store .cse279 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse277 (select (select .cse277 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse280 (store (store |c_#memory_$Pointer$.base| .cse278 (store .cse279 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse280 (select (select .cse280 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)) (not (= .cse278 |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse114 (forall ((v_arrayElimCell_96 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse276 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse275 (select (select .cse276 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse273 (let ((.cse274 (store (store |c_#memory_$Pointer$.base| .cse275 (store (select .cse276 .cse275) v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse274 (select (select .cse274 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse273 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_arrayElimCell_98 Int)) (= (select .cse273 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))) (not (= .cse275 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse103 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2126 (Array Int Int))) (let ((.cse269 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse269 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse271 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse269))) (or (= (select (let ((.cse270 (store (store |c_#memory_$Pointer$.base| .cse269 (store .cse271 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse270 (select (select .cse270 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (forall ((v_arrayElimCell_98 Int)) (= (select (let ((.cse272 (store (store |c_#memory_$Pointer$.base| .cse269 (store .cse271 v_arrayElimCell_96 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse272 (select (select .cse272 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))))) (.cse104 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse266 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse267 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse266))) (let ((.cse264 (let ((.cse268 (store (store |c_#memory_$Pointer$.base| .cse266 (store .cse267 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse268 (select (select .cse268 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_98 Int)) (or (= (select .cse264 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse265 (store (store |c_#memory_$Pointer$.base| .cse266 (store .cse267 v_arrayElimCell_96 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse265 (select (select .cse265 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) (= (select .cse264 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse264 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))) (.cse115 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse263 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse260 (select (select .cse263 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse261 (select .cse263 .cse260))) (let ((.cse258 (let ((.cse262 (store (store |c_#memory_$Pointer$.base| .cse260 (store .cse261 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse262 (select (select .cse262 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse257 (let ((.cse259 (store (store |c_#memory_$Pointer$.base| .cse260 (store .cse261 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse259 (select (select .cse259 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse257 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse257 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse258 v_arrayElimCell_100)) (= (select .cse258 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse257 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse116 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse256 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse253 (select (select .cse256 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse254 (select .cse256 .cse253))) (let ((.cse250 (let ((.cse255 (store (store |c_#memory_$Pointer$.base| .cse253 (store .cse254 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse255 (select (select .cse255 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse250 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_arrayElimCell_99 Int)) (let ((.cse251 (let ((.cse252 (store (store |c_#memory_$Pointer$.base| .cse253 (store .cse254 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse252 (select (select .cse252 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse251 v_arrayElimCell_100)) (forall ((v_arrayElimCell_98 Int)) (or (= (select .cse250 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse251 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))) (= (select .cse250 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse117 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse249 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse245 (select (select .cse249 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse245 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse247 (select .cse249 .cse245))) (or (= (select (let ((.cse246 (store (store |c_#memory_$Pointer$.base| .cse245 (store .cse247 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse246 (select (select .cse246 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select (let ((.cse248 (store (store |c_#memory_$Pointer$.base| .cse245 (store .cse247 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse248 (select (select .cse248 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse96 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int)) (= (select (select (store (let ((.cse244 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse243 (select (select .cse244 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse243 (store (select .cse244 .cse243) v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)))) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))) (.cse97 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse242 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse239 (select (select .cse242 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse240 (select .cse242 .cse239)) (.cse241 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| .cse239 (store .cse240 v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse241) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse239 (store .cse240 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse241) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (.cse98 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse238 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse237 (select (select .cse238 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_98 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse237 (store (select .cse238 .cse237) v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse237 |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (.cse119 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse236 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse233 (select (select .cse236 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse234 (select .cse236 .cse233))) (let ((.cse231 (let ((.cse235 (store (store |c_#memory_$Pointer$.base| .cse233 (store .cse234 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse235 (select (select .cse235 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse231 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse231 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse231 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select (let ((.cse232 (store (store |c_#memory_$Pointer$.base| .cse233 (store .cse234 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse232 (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse52 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse230 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (let ((.cse229 (store (store |c_#memory_$Pointer$.base| .cse230 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse230) v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse229 (select (select .cse229 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= .cse230 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (.cse120 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse228 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse226 (select (select .cse228 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse226 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (let ((.cse227 (store (store |c_#memory_$Pointer$.base| .cse226 (store (select .cse228 .cse226) v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse227 (select (select .cse227 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse122 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse225 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse222 (select (select .cse225 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse223 (select .cse225 .cse222))) (let ((.cse220 (let ((.cse224 (store (store |c_#memory_$Pointer$.base| .cse222 (store .cse223 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse224 (select (select .cse224 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (or (= (select .cse220 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse221 (store (store |c_#memory_$Pointer$.base| .cse222 (store .cse223 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse221 (select (select .cse221 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)))) (= (select .cse220 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_arrayElimCell_98 Int)) (= (select .cse220 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))))))) (.cse123 (or (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse219 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse216 (select (select .cse219 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse217 (select .cse219 .cse216)) (.cse218 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| .cse216 (store .cse217 v_arrayElimCell_96 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse218) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse216 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse216 (store .cse217 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse218) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) .cse19 .cse20)) (.cse124 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse215 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse212 (select (select .cse215 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse213 (select .cse215 .cse212))) (let ((.cse209 (let ((.cse214 (store (store |c_#memory_$Pointer$.base| .cse212 (store .cse213 v_arrayElimCell_96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse214 (select (select .cse214 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse210 (let ((.cse211 (store (store |c_#memory_$Pointer$.base| .cse212 (store .cse213 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse211 (select (select .cse211 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse209 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse209 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse210 v_arrayElimCell_100)) (= (select .cse210 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse209 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse210 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1))))) (.cse17 (not .cse26))) (and (or .cse0 .cse1 (and .cse2 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse5 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse5))) (let ((.cse3 (let ((.cse7 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse3 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (forall ((v_arrayElimCell_98 Int)) (or (= (select .cse3 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 v_arrayElimCell_97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) (= (select .cse3 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))) (forall ((v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_97 Int)) (let ((.cse8 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse10 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse8))) (or (forall ((v_arrayElimCell_98 Int)) (= (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| .cse8 (store .cse10 v_arrayElimCell_97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| .cse8 (store .cse10 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse14 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse15 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse14))) (let ((.cse12 (let ((.cse16 (store (store |c_#memory_$Pointer$.base| .cse14 (store .cse15 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse12 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| .cse14 (store .cse15 v_arrayElimCell_97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse12 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))) .cse17) .cse18)) (or .cse19 .cse20 (and (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse23 (select .cse25 .cse22)) (.cse24 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (select (store (store |c_#memory_$Pointer$.base| .cse22 (store .cse23 v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse24))) (or (= (select .cse21 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse22 (store .cse23 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse24) v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse21 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) .cse26) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int)) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse30 (select .cse32 .cse29)) (.cse31 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (select (store (store |c_#memory_$Pointer$.base| .cse29 (store .cse30 v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse31))) (or (= (select .cse27 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_99 Int)) (let ((.cse28 (select (store (store |c_#memory_$Pointer$.base| .cse29 (store .cse30 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse31))) (or (forall ((v_arrayElimCell_98 Int)) (or (= (select .cse27 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse28 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))) (= (select .cse28 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|)))))))))))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse36 (select (select .cse39 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse37 (select .cse39 .cse36))) (let ((.cse34 (let ((.cse38 (store (store |c_#memory_$Pointer$.base| .cse36 (store .cse37 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse38 (select (select .cse38 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_arrayElimCell_99 Int)) (let ((.cse33 (let ((.cse35 (store (store |c_#memory_$Pointer$.base| .cse36 (store .cse37 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse35 (select (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse33 v_arrayElimCell_100)) (forall ((v_arrayElimCell_98 Int)) (or (= (select .cse34 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse33 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))) (= (select .cse34 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))) (= (select .cse34 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or .cse0 .cse1 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse42 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse43 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse42))) (let ((.cse40 (let ((.cse44 (store (store |c_#memory_$Pointer$.base| .cse42 (store .cse43 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse44 (select (select .cse44 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse40 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse41 (store (store |c_#memory_$Pointer$.base| .cse42 (store .cse43 v_arrayElimCell_97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse40 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= .cse42 |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse51 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse48 (select (select .cse51 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse49 (select .cse51 .cse48))) (let ((.cse45 (let ((.cse50 (store (store |c_#memory_$Pointer$.base| .cse48 (store .cse49 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse50 (select (select .cse50 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse46 (let ((.cse47 (store (store |c_#memory_$Pointer$.base| .cse48 (store .cse49 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse45 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse45 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse45 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse46 v_arrayElimCell_100)) (= (select .cse46 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))))) (or .cse52 .cse0 .cse26 .cse1) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse59 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse56 (select (select .cse59 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse57 (select .cse59 .cse56))) (let ((.cse53 (let ((.cse58 (store (store |c_#memory_$Pointer$.base| .cse56 (store .cse57 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse58 (select (select .cse58 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse54 (let ((.cse55 (store (store |c_#memory_$Pointer$.base| .cse56 (store .cse57 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse55 (select (select .cse55 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse53 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse53 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse53 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse54 v_arrayElimCell_100)) (= (select .cse54 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse54 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse63 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse60 (select (select .cse63 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse60 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse61 (let ((.cse62 (store (store |c_#memory_$Pointer$.base| .cse60 (store (select .cse63 .cse60) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse62 (select (select .cse62 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse61 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse61 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse69 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse66 (select (select .cse69 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse67 (select .cse69 .cse66))) (let ((.cse64 (let ((.cse68 (store (store |c_#memory_$Pointer$.base| .cse66 (store .cse67 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse68 (select (select .cse68 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse64 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse64 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse64 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select (let ((.cse65 (store (store |c_#memory_$Pointer$.base| .cse66 (store .cse67 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse65 (select (select .cse65 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse76 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse73 (select (select .cse76 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse74 (select .cse76 .cse73))) (let ((.cse70 (let ((.cse75 (store (store |c_#memory_$Pointer$.base| .cse73 (store .cse74 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse75 (select (select .cse75 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse71 (let ((.cse72 (store (store |c_#memory_$Pointer$.base| .cse73 (store .cse74 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse72 (select (select .cse72 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse70 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse70 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select .cse71 v_arrayElimCell_100)) (= (select .cse71 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse77 (let ((.cse78 (store (let ((.cse80 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse79 (select (select .cse80 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse79 (store (select .cse80 .cse79) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse78 (select (select .cse78 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse77 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse77 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse77 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or .cse19 .cse20 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse81 (select (select .cse84 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse82 (select .cse84 .cse81)) (.cse83 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse81 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse81 (store .cse82 v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse83) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse81 (store .cse82 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse83) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse87 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse86 (select (select .cse87 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (let ((.cse85 (store (store |c_#memory_$Pointer$.base| .cse86 (store (select .cse87 .cse86) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse85 (select (select .cse85 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= .cse86 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (and .cse88 .cse89 .cse90 .cse91 .cse92 .cse93 (or .cse19 .cse20 (and .cse94 (or .cse26 .cse95))) (or (and (or .cse96 .cse26) .cse97 .cse98) .cse19 .cse20) (or .cse19 .cse20 .cse26 .cse99) .cse100 .cse101 (or .cse19 .cse20 .cse26 .cse102) (or .cse0 .cse1 (and .cse103 .cse2 .cse18 .cse104 (or .cse17 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse107 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse108 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse107))) (let ((.cse105 (let ((.cse109 (store (store |c_#memory_$Pointer$.base| .cse107 (store .cse108 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse109 (select (select .cse109 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse105 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse105 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (let ((.cse106 (store (store |c_#memory_$Pointer$.base| .cse107 (store .cse108 v_arrayElimCell_96 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse106 (select (select .cse106 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))))) .cse110 .cse111 .cse112 .cse113 .cse114 .cse115 .cse116 .cse117 (or .cse0 .cse118 .cse26 .cse1) .cse119 .cse120 (or .cse19 .cse121 .cse20 .cse26) .cse122 .cse123 .cse124)) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse127 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse125 (select (select .cse127 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse125 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int))) (= (select (let ((.cse126 (store (store |c_#memory_$Pointer$.base| .cse125 (store (select .cse127 .cse125) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse126 (select (select .cse126 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse131 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse130 (select (select .cse131 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse128 (let ((.cse129 (store (store |c_#memory_$Pointer$.base| .cse130 (store (select .cse131 .cse130) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse129 (select (select .cse129 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse128 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_arrayElimCell_98 Int)) (= (select .cse128 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))) (not (= .cse130 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or .cse0 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse133 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse134 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse133))) (let ((.cse135 (let ((.cse136 (store (store |c_#memory_$Pointer$.base| .cse133 (store .cse134 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse136 (select (select .cse136 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select (let ((.cse132 (store (store |c_#memory_$Pointer$.base| .cse133 (store .cse134 v_arrayElimCell_97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse132 (select (select .cse132 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse135 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse135 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))) .cse26 .cse1) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int)) (let ((.cse137 (let ((.cse138 (store (let ((.cse140 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse139 (select (select .cse140 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse139 (store (select .cse140 .cse139) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse138 (select (select .cse138 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse137 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse137 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse145 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse142 (select (select .cse145 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse143 (select .cse145 .cse142))) (or (= (select (let ((.cse141 (store (store |c_#memory_$Pointer$.base| .cse142 (store .cse143 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse141 (select (select .cse141 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse144 (store (store |c_#memory_$Pointer$.base| .cse142 (store .cse143 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse144 (select (select .cse144 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)) (not (= .cse142 |c_ULTIMATE.start_main_~#s~0#1.base|))))))))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse150 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse147 (select (select .cse150 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse148 (select .cse150 .cse147)) (.cse149 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse146 (select (store (store |c_#memory_$Pointer$.base| .cse147 (store .cse148 v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse149))) (or (= (select .cse146 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse146 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse147 (store .cse148 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse149) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) .cse19 .cse20 .cse26) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse154 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse151 (select (select .cse154 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse152 (let ((.cse153 (store (store |c_#memory_$Pointer$.base| .cse151 (store (select .cse154 .cse151) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse153 (select (select .cse153 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse151 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse152 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse152 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or (and .cse88 .cse89 .cse90 (or .cse19 .cse20 .cse99) (or .cse0 .cse118 .cse1) .cse91 .cse92 .cse93 .cse100 (or .cse19 .cse121 .cse20) .cse101 .cse110 (or .cse19 .cse20 .cse102) .cse111 (or .cse19 .cse20 (and .cse94 .cse95)) .cse112 .cse113 .cse114 (or (and .cse103 .cse104 .cse155 .cse156) .cse0 .cse1) .cse115 .cse116 .cse117 (or .cse19 (and .cse96 .cse97 .cse98) .cse20) (or .cse0 .cse1 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse158 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse157 (let ((.cse159 (store (store |c_#memory_$Pointer$.base| .cse158 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse158) v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse159 (select (select .cse159 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse157 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse157 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= .cse158 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) .cse119 (or .cse52 .cse0 .cse1) .cse120 .cse122 .cse123 .cse124) .cse26) (or .cse19 .cse20 .cse26 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (let ((.cse160 (select (store (let ((.cse162 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse161 (select (select .cse162 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse161 (store (select .cse162 .cse161) v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)))) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse160 v_arrayElimCell_100) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse160 v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse166 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse163 (select (select .cse166 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse163 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse164 (let ((.cse165 (store (store |c_#memory_$Pointer$.base| .cse163 (store (select .cse166 .cse163) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse165 (select (select .cse165 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse164 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse164 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or (and (forall ((v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_97 Int)) (let ((.cse169 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse167 (let ((.cse168 (store (store |c_#memory_$Pointer$.base| .cse169 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse169) v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse168 (select (select .cse168 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse167 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse167 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))) (= .cse169 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or .cse17 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_99 Int)) (let ((.cse171 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (let ((.cse170 (store (store |c_#memory_$Pointer$.base| .cse171 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse171) v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse170 (select (select .cse170 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= .cse171 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) .cse0 .cse1) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse177 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse174 (select (select .cse177 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse175 (select .cse177 .cse174))) (let ((.cse172 (let ((.cse176 (store (store |c_#memory_$Pointer$.base| .cse174 (store .cse175 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse176 (select (select .cse176 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (or (= (select .cse172 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse173 (store (store |c_#memory_$Pointer$.base| .cse174 (store .cse175 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse173 (select (select .cse173 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)))) (= (select .cse172 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_arrayElimCell_98 Int)) (= (select .cse172 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or .cse0 .cse1 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse181 (select v_ArrVal_2126 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse182 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2126) .cse181))) (let ((.cse179 (let ((.cse183 (store (store |c_#memory_$Pointer$.base| .cse181 (store .cse182 v_arrayElimCell_97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse183 (select (select .cse183 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse178 (let ((.cse180 (store (store |c_#memory_$Pointer$.base| .cse181 (store .cse182 v_arrayElimCell_99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2118))) (select .cse180 (select (select .cse180 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse178 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse179 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse179 v_arrayElimCell_98) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse178 v_arrayElimCell_100) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select .cse178 v_arrayElimCell_97) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (let ((.cse185 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse184 (select (select .cse185 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse184 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse184 (store (select .cse185 .cse184) v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse19 .cse20 .cse26) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int))) (let ((.cse188 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse186 (select (select .cse188 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse186 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (let ((.cse187 (store (store |c_#memory_$Pointer$.base| .cse186 (store (select .cse188 .cse186) v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse187 (select (select .cse187 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse194 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse191 (select (select .cse194 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse192 (select .cse194 .cse191))) (let ((.cse189 (let ((.cse193 (store (store |c_#memory_$Pointer$.base| .cse191 (store .cse192 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse193 (select (select .cse193 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse189 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= (select .cse189 v_arrayElimCell_97) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse190 (store (store |c_#memory_$Pointer$.base| .cse191 (store .cse192 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse190 (select (select .cse190 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)))) (or .cse19 .cse20 (and (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_97 Int)) (let ((.cse196 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse195 (select (select .cse196 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_98 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse195 (store (select .cse196 .cse195) v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse195 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (or .cse26 (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (= (select (select (store (let ((.cse198 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse197 (select (select .cse198 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse197 (store (select .cse198 .cse197) v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)))) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|))) (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse202 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2126))) (let ((.cse199 (select (select .cse202 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse200 (select .cse202 .cse199)) (.cse201 (select v_ArrVal_2118 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| .cse199 (store .cse200 v_arrayElimCell_97 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse201) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse199 (store .cse200 v_arrayElimCell_99 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2118) .cse201) v_arrayElimCell_98) |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (forall ((v_arrayElimCell_97 Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| 1)) (forall ((v_ArrVal_2126 (Array Int Int))) (let ((.cse208 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2126))) (let ((.cse205 (select (select .cse208 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse206 (select .cse208 .cse205))) (let ((.cse203 (let ((.cse207 (store (store |c_#memory_$Pointer$.base| .cse205 (store .cse206 v_arrayElimCell_97 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse207 (select (select .cse207 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse203 v_arrayElimCell_100) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| (select (let ((.cse204 (store (store |c_#memory_$Pointer$.base| .cse205 (store .cse206 v_arrayElimCell_99 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44| v_ArrVal_2118))) (select .cse204 (select (select .cse204 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_100)) (forall ((v_arrayElimCell_98 Int)) (= (select .cse203 v_arrayElimCell_98) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_44|)))))) (not (= .cse205 |c_ULTIMATE.start_main_~#s~0#1.base|))))))))))) is different from true [2023-12-02 16:07:29,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648643679] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:07:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1688481155] [2023-12-02 16:07:29,299 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-12-02 16:07:29,299 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:07:29,299 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:07:29,300 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:07:29,300 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:07:30,366 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:07:30,383 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:07:41,658 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7786#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 1) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40| Int) (|v_#memory_$Pointer$.offset_274| (Array Int (Array Int Int))) (|v_#memory_int_233| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_50| Int) (|v_#memory_int_234| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_287| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46| Int)) (and (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_50|) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40|) 1) (= (store |v_#memory_int_233| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46| (store (select |v_#memory_int_233| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_50| (select (select |v_#memory_int_234| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_50|))) |v_#memory_int_234|) (= |#memory_int| (store |v_#memory_int_234| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40| (store (select |v_#memory_int_234| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40|) 0)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_287| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46| (store (select |v_#memory_$Pointer$.base_287| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_50| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40| (store (select (store |v_#memory_$Pointer$.base_287| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46| (store (select |v_#memory_$Pointer$.base_287| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_50| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46|) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_274| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46| (store (select |v_#memory_$Pointer$.offset_274| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_50| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40| (store (select (store |v_#memory_$Pointer$.offset_274| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46| (store (select |v_#memory_$Pointer$.offset_274| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_50| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40|) 0)))) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_50| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46|)) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_50| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_46| 0))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_40|)))) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:07:41,658 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:07:41,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:07:41,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 36 [2023-12-02 16:07:41,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016808595] [2023-12-02 16:07:41,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:07:41,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 16:07:41,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:07:41,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 16:07:41,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3917, Unknown=49, NotChecked=650, Total=4830 [2023-12-02 16:07:41,662 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 37 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 32 states have internal predecessors, (59), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:07:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:07:47,019 INFO L93 Difference]: Finished difference Result 173 states and 194 transitions. [2023-12-02 16:07:47,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 16:07:47,019 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 32 states have internal predecessors, (59), 4 states have call successors, (6), 2 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 41 [2023-12-02 16:07:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:07:47,021 INFO L225 Difference]: With dead ends: 173 [2023-12-02 16:07:47,021 INFO L226 Difference]: Without dead ends: 173 [2023-12-02 16:07:47,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=353, Invalid=6093, Unknown=54, NotChecked=810, Total=7310 [2023-12-02 16:07:47,022 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 258 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:07:47,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1062 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-02 16:07:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-02 16:07:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 110. [2023-12-02 16:07:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 103 states have internal predecessors, (119), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 16:07:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2023-12-02 16:07:47,028 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 41 [2023-12-02 16:07:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:07:47,028 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2023-12-02 16:07:47,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 32 states have internal predecessors, (59), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:07:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2023-12-02 16:07:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 16:07:47,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:07:47,029 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:07:47,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 16:07:47,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:07:47,230 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:07:47,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:07:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash -959259050, now seen corresponding path program 1 times [2023-12-02 16:07:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:07:47,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861990926] [2023-12-02 16:07:47,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:07:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:07:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:07:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:07:50,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:07:50,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861990926] [2023-12-02 16:07:50,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861990926] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:07:50,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879450177] [2023-12-02 16:07:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:07:50,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:07:50,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:07:50,426 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:07:50,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 16:07:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:07:50,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 101 conjunts are in the unsatisfiable core [2023-12-02 16:07:50,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:07:51,494 INFO L378 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-12-02 16:07:51,729 INFO L349 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2023-12-02 16:07:51,729 INFO L378 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 38 treesize of output 39 [2023-12-02 16:07:51,742 INFO L378 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-12-02 16:07:51,954 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:07:51,954 INFO L378 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 20 [2023-12-02 16:07:51,962 INFO L378 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-12-02 16:07:51,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2023-12-02 16:07:52,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:07:52,608 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 16:07:52,608 INFO L378 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 34 [2023-12-02 16:07:52,649 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:07:52,649 INFO L378 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-12-02 16:07:52,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:07:52,684 INFO L378 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-12-02 16:07:53,779 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 16:07:53,779 INFO L378 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 82 treesize of output 56 [2023-12-02 16:07:53,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:07:53,797 INFO L378 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 27 treesize of output 22 [2023-12-02 16:07:54,032 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 16:07:54,032 INFO L378 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 102 treesize of output 73 [2023-12-02 16:07:54,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:07:54,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:07:54,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-12-02 16:07:54,544 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:07:54,545 INFO L378 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 65 treesize of output 32 [2023-12-02 16:07:54,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 16:07:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:07:54,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:07:55,457 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2272)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2273))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (forall ((v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (<= 0 (+ (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2272))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2273) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 4)))) is different from false [2023-12-02 16:07:56,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:07:56,766 INFO L378 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 370 treesize of output 374 [2023-12-02 16:07:57,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879450177] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:07:57,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1239242187] [2023-12-02 16:07:57,577 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-12-02 16:07:57,577 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:07:57,577 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:07:57,577 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:07:57,577 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:07:58,568 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2023-12-02 16:07:58,588 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:08:12,907 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8360#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 1) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (or (< (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51| Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_56| Int) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43| Int) (|v_#memory_int_249| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_296| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_311| (Array Int (Array Int Int))) (|v_#memory_int_250| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_250| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43| (store (select |v_#memory_int_250| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43|) 1) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_56| 0))) (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_56|) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43|)) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_56| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51|)) (= (store (store |v_#memory_$Pointer$.base_311| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51| (store (select |v_#memory_$Pointer$.base_311| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_56| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43| (store (select (store |v_#memory_$Pointer$.base_311| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51| (store (select |v_#memory_$Pointer$.base_311| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_56| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43|) 0))) |#memory_$Pointer$.base|) (= (store |v_#memory_int_249| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51| (store (select |v_#memory_int_249| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_56| (select (select |v_#memory_int_250| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_56|))) |v_#memory_int_250|) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51|) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_296| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51| (store (select |v_#memory_$Pointer$.offset_296| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_56| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43| (store (select (store |v_#memory_$Pointer$.offset_296| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51| (store (select |v_#memory_$Pointer$.offset_296| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_51|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_56| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_43|) 0)))))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:08:12,907 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:08:12,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:08:12,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 51 [2023-12-02 16:08:12,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442229821] [2023-12-02 16:08:12,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:08:12,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 16:08:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:08:12,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 16:08:12,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=7179, Unknown=21, NotChecked=170, Total=7656 [2023-12-02 16:08:12,909 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 52 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 43 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 16:08:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:08:21,482 INFO L93 Difference]: Finished difference Result 177 states and 206 transitions. [2023-12-02 16:08:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 16:08:21,483 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 43 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2023-12-02 16:08:21,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:08:21,485 INFO L225 Difference]: With dead ends: 177 [2023-12-02 16:08:21,485 INFO L226 Difference]: Without dead ends: 177 [2023-12-02 16:08:21,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3077 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=453, Invalid=10449, Unknown=22, NotChecked=206, Total=11130 [2023-12-02 16:08:21,486 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 335 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 2477 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-02 16:08:21,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1560 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2477 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-02 16:08:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-02 16:08:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 116. [2023-12-02 16:08:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 109 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 16:08:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2023-12-02 16:08:21,491 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 41 [2023-12-02 16:08:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:08:21,491 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2023-12-02 16:08:21,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 43 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 16:08:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2023-12-02 16:08:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 16:08:21,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:08:21,492 INFO L195 NwaCegarLoop]: trace histogram [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-12-02 16:08:21,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 16:08:21,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 16:08:21,693 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:08:21,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:08:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2056955929, now seen corresponding path program 1 times [2023-12-02 16:08:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:08:21,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913586584] [2023-12-02 16:08:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:08:21,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:08:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:08:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:08:22,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:08:22,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913586584] [2023-12-02 16:08:22,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913586584] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:08:22,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770437887] [2023-12-02 16:08:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:08:22,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:08:22,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:08:22,288 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:08:22,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 16:08:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:08:22,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 16:08:22,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:08:22,486 INFO L378 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-12-02 16:08:22,580 WARN L876 $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|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-12-02 16:08:22,609 INFO L378 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-12-02 16:08:22,662 INFO L378 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-12-02 16:08:22,720 INFO L378 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-12-02 16:08:22,732 INFO L378 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-12-02 16:08:22,806 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:08:22,806 INFO L378 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-12-02 16:08:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:08:22,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:08:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:08:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770437887] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:08:23,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1484453446] [2023-12-02 16:08:23,969 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-12-02 16:08:23,969 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:08:23,969 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:08:23,969 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:08:23,969 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:08:24,976 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2023-12-02 16:08:24,999 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:08:26,154 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse0 (exists ((|v_#valid_276| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_276| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 1)) (= (select |v_#valid_276| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0)))) (.cse1 (exists ((|v_#memory_$Pointer$.base_340| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_340| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (store (select |v_#memory_$Pointer$.base_340| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4)))))) (.cse2 (exists ((|v_#length_229| (Array Int Int))) (= |c_#length| (store |v_#length_229| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 8)))) (.cse3 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|))) (.cse5 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse7 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse8 (<= (+ |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 1) |c_#StackHeapBarrier|)) (.cse9 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)) (.cse10 (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 0))) (.cse11 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse12 (exists ((|v_#memory_int_279| (Array Int (Array Int Int))) (|v_#memory_int_278| (Array Int (Array Int Int)))) (let ((.cse17 (select |v_#memory_int_279| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|))) (and (= (store |v_#memory_int_279| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store .cse17 4 1)) |c_#memory_int|) (= |v_#memory_int_279| (store |v_#memory_int_278| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (select |v_#memory_int_278| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 (select .cse17 0)))))))) (.cse13 (exists ((|v_#memory_$Pointer$.offset_325| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_325| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (store (select |v_#memory_$Pointer$.offset_325| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4))) |c_#memory_$Pointer$.offset|))) (.cse14 (exists ((|v_#length_228| (Array Int Int))) (and (= (select |v_#length_228| 1) 2) (= 23 (select |v_#length_228| 2))))) (.cse15 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((|v_old(#memory_int)_AFTER_CALL_161| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_old(#memory_int)_AFTER_CALL_161| 1))) (and (= 48 (select .cse6 0)) (= (select .cse6 1) 0)))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_160| (Array Int (Array Int Int)))) (let ((.cse16 (select |v_old(#memory_int)_AFTER_CALL_160| 1))) (and (= (select .cse16 1) 0) (= 48 (select .cse16 0))))) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) (= |c_ULTIMATE.start_sll_circular_create_~len#1| 2) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-12-02 16:08:37,237 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8987#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_38| Int) (|v_#memory_$Pointer$.base_345| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_330| (Array Int (Array Int Int))) (|v_#memory_int_283| (Array Int (Array Int Int))) (|v_#memory_int_284| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.offset_330| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0) (store (select |v_#memory_$Pointer$.offset_330| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38| (store (select (store |v_#memory_$Pointer$.offset_330| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0) (store (select |v_#memory_$Pointer$.offset_330| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0 0)) |#memory_$Pointer$.offset|) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|)) (= (select (select |v_#memory_$Pointer$.base_345| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_330| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0) 0) (= (store |v_#memory_int_283| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0) (store (select |v_#memory_int_283| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0)) 0 (select (select |v_#memory_int_284| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0)) 0))) |v_#memory_int_284|) (<= 2 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0))) (= |#memory_int| (store |v_#memory_int_284| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38| (store (select |v_#memory_int_284| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 1) (= (store (store |v_#memory_$Pointer$.base_345| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0) (store (select |v_#memory_$Pointer$.base_345| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38| (store (select (store |v_#memory_$Pointer$.base_345| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0) (store (select |v_#memory_$Pointer$.base_345| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_38|) 0))) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:08:37,237 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:08:37,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:08:37,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 25 [2023-12-02 16:08:37,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159479595] [2023-12-02 16:08:37,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:08:37,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 16:08:37,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:08:37,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 16:08:37,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2179, Unknown=13, NotChecked=190, Total=2550 [2023-12-02 16:08:37,240 INFO L87 Difference]: Start difference. First operand 116 states and 137 transitions. Second operand has 25 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-02 16:08:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:08:39,469 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2023-12-02 16:08:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 16:08:39,470 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 42 [2023-12-02 16:08:39,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:08:39,471 INFO L225 Difference]: With dead ends: 110 [2023-12-02 16:08:39,471 INFO L226 Difference]: Without dead ends: 110 [2023-12-02 16:08:39,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=335, Invalid=3691, Unknown=14, NotChecked=250, Total=4290 [2023-12-02 16:08:39,472 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 203 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:08:39,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 500 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 666 Invalid, 0 Unknown, 85 Unchecked, 1.1s Time] [2023-12-02 16:08:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-02 16:08:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-12-02 16:08:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 103 states have internal predecessors, (119), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 16:08:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2023-12-02 16:08:39,476 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 42 [2023-12-02 16:08:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:08:39,477 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2023-12-02 16:08:39,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-02 16:08:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2023-12-02 16:08:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 16:08:39,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:08:39,478 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:08:39,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 16:08:39,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 16:08:39,679 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:08:39,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:08:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1426103264, now seen corresponding path program 1 times [2023-12-02 16:08:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:08:39,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117952891] [2023-12-02 16:08:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:08:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:08:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:08:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:08:42,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:08:42,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117952891] [2023-12-02 16:08:42,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117952891] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:08:42,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297404522] [2023-12-02 16:08:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:08:42,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:08:42,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:08:42,694 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:08:42,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 16:08:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:08:42,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 124 conjunts are in the unsatisfiable core [2023-12-02 16:08:42,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:08:42,895 INFO L378 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-12-02 16:08:43,250 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:08:43,250 INFO L378 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-12-02 16:08:43,584 INFO L378 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-12-02 16:08:43,831 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 16:08:43,832 INFO L378 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 54 treesize of output 41 [2023-12-02 16:08:44,023 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:08:44,023 INFO L378 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 48 treesize of output 23 [2023-12-02 16:08:44,030 INFO L378 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-12-02 16:08:44,036 INFO L378 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-12-02 16:08:44,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:08:44,610 INFO L378 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-12-02 16:08:44,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:08:44,654 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 16:08:44,654 INFO L378 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 56 treesize of output 45 [2023-12-02 16:08:44,740 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2023-12-02 16:08:44,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2023-12-02 16:08:46,258 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 16:08:46,259 INFO L378 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 117 treesize of output 59 [2023-12-02 16:08:46,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:08:46,293 INFO L378 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 27 treesize of output 22 [2023-12-02 16:08:46,565 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-12-02 16:08:46,565 INFO L378 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 196 treesize of output 96 [2023-12-02 16:08:46,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:08:46,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:08:46,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:08:46,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-12-02 16:08:47,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:08:47,511 INFO L378 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-02 16:08:47,924 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 16:08:47,924 INFO L378 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 47 [2023-12-02 16:08:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:08:48,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:08:49,833 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2589 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_59| Int) (v_ArrVal_2580 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_59| 1)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_59| 1) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_59| v_ArrVal_2589)) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_59| v_ArrVal_2590))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse8 (select (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select .cse9 .cse4) .cse8 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_59| v_ArrVal_2580)) (.cse0 (let ((.cse7 (select .cse6 .cse4))) (let ((.cse5 (store .cse7 .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_59|))) (store (store |c_#memory_$Pointer$.base| .cse4 .cse5) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_59| (store (select (store .cse6 .cse4 .cse5) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_59|) 0 (select .cse7 .cse8))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_59|) 0)))) is different from false [2023-12-02 16:08:49,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297404522] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:08:49,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [514208917] [2023-12-02 16:08:49,840 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-12-02 16:08:49,840 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:08:49,840 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:08:49,840 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:08:49,840 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:08:50,877 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2023-12-02 16:08:50,898 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:09:06,990 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9509#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~ptr~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 1) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~ptr~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_main_~count~0#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62| Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_67| Int) (|v_#memory_$Pointer$.base_369| (Array Int (Array Int Int))) (|v_#memory_int_300| (Array Int (Array Int Int))) (|v_#memory_int_299| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_352| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50| Int)) (and (= (store (store |v_#memory_$Pointer$.base_369| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62| (store (select |v_#memory_$Pointer$.base_369| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_67| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50| (store (select (store |v_#memory_$Pointer$.base_369| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62| (store (select |v_#memory_$Pointer$.base_369| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_67| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50|) 0))) |#memory_$Pointer$.base|) (= 1 (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50|) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_352| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62| (store (select |v_#memory_$Pointer$.offset_352| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_67| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50| (store (select (store |v_#memory_$Pointer$.offset_352| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62| (store (select |v_#memory_$Pointer$.offset_352| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_67| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50|) 0)))) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_67| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62|)) (= (store |v_#memory_int_299| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62| (store (select |v_#memory_int_299| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_67| (select (select |v_#memory_int_300| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_67|))) |v_#memory_int_300|) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50|)) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_67| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_62| 0))) (= |#memory_int| (store |v_#memory_int_300| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50| (store (select |v_#memory_int_300| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_50|) 0)))) (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_67|))) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))))' at error location [2023-12-02 16:09:06,990 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:09:06,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:09:06,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 48 [2023-12-02 16:09:06,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522001825] [2023-12-02 16:09:06,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:09:06,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-02 16:09:06,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:09:06,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-02 16:09:06,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=6841, Unknown=23, NotChecked=166, Total=7310 [2023-12-02 16:09:06,992 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 49 states, 40 states have (on average 1.8) internal successors, (72), 42 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 16:09:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:09:14,272 INFO L93 Difference]: Finished difference Result 182 states and 207 transitions. [2023-12-02 16:09:14,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 16:09:14,273 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 40 states have (on average 1.8) internal successors, (72), 42 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2023-12-02 16:09:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:09:14,274 INFO L225 Difference]: With dead ends: 182 [2023-12-02 16:09:14,274 INFO L226 Difference]: Without dead ends: 182 [2023-12-02 16:09:14,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2675 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=447, Invalid=9835, Unknown=24, NotChecked=200, Total=10506 [2023-12-02 16:09:14,276 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 404 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:09:14,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 930 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-02 16:09:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-02 16:09:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 108. [2023-12-02 16:09:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 101 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 16:09:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2023-12-02 16:09:14,279 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 44 [2023-12-02 16:09:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:09:14,280 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2023-12-02 16:09:14,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 40 states have (on average 1.8) internal successors, (72), 42 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 16:09:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2023-12-02 16:09:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 16:09:14,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:09:14,280 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:09:14,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-02 16:09:14,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 16:09:14,481 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:09:14,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:09:14,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1426103265, now seen corresponding path program 1 times [2023-12-02 16:09:14,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:09:14,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498695890] [2023-12-02 16:09:14,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:09:14,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:09:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:09:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:09:18,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:09:18,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498695890] [2023-12-02 16:09:18,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498695890] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:09:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121474824] [2023-12-02 16:09:18,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:09:18,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:09:18,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:09:18,316 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:09:18,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 16:09:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:09:18,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 126 conjunts are in the unsatisfiable core [2023-12-02 16:09:18,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:09:18,551 INFO L378 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-12-02 16:09:19,472 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 16:09:19,472 INFO L378 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-12-02 16:09:19,515 INFO L378 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 16 treesize of output 11 [2023-12-02 16:09:19,933 INFO L378 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-12-02 16:09:19,953 INFO L378 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 15 treesize of output 1 [2023-12-02 16:09:20,243 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-12-02 16:09:20,243 INFO L378 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 133 treesize of output 102 [2023-12-02 16:09:20,254 INFO L378 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 79 treesize of output 44 [2023-12-02 16:09:20,512 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 16:09:20,513 INFO L378 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 102 treesize of output 49 [2023-12-02 16:09:20,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:09:20,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2023-12-02 16:09:20,529 INFO L378 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-12-02 16:09:20,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:09:20,841 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 16:09:20,842 INFO L378 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 89 [2023-12-02 16:09:20,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:09:20,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:09:20,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:09:20,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 76 [2023-12-02 16:09:20,916 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-12-02 16:09:20,916 INFO L378 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 32 treesize of output 34 [2023-12-02 16:09:20,934 INFO L378 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 40 treesize of output 35 [2023-12-02 16:09:22,372 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2023-12-02 16:09:22,372 INFO L378 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 94 [2023-12-02 16:09:22,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:09:22,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 46 [2023-12-02 16:09:22,705 INFO L349 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2023-12-02 16:09:22,705 INFO L378 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 371 treesize of output 178 [2023-12-02 16:09:22,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:09:22,758 INFO L349 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2023-12-02 16:09:22,759 INFO L378 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 287 treesize of output 174 [2023-12-02 16:09:23,996 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-12-02 16:09:23,996 INFO L378 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 283 treesize of output 92 [2023-12-02 16:09:24,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:09:24,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:09:24,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 20 [2023-12-02 16:09:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:09:24,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:09:45,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121474824] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:09:45,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1227816613] [2023-12-02 16:09:45,627 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-12-02 16:09:45,627 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:09:45,627 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:09:45,627 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:09:45,628 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:09:46,673 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:09:46,691 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:10:08,189 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10114#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~ptr~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 1) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (or (< (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~ptr~0#1.base|) (exists ((|v_#memory_$Pointer$.base_393| (Array Int (Array Int Int))) (|v_#memory_int_316| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53| Int) (|v_#memory_int_315| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_73| Int) (|v_#memory_$Pointer$.offset_376| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67| Int)) (and (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53|)) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_376| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67| (store (select |v_#memory_$Pointer$.offset_376| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_73| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53| (store (select (store |v_#memory_$Pointer$.offset_376| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67| (store (select |v_#memory_$Pointer$.offset_376| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_73| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53|) 0)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_393| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67| (store (select |v_#memory_$Pointer$.base_393| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_73| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53| (store (select (store |v_#memory_$Pointer$.base_393| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67| (store (select |v_#memory_$Pointer$.base_393| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_73| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53|) 0)))) (= (store |v_#memory_int_315| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67| (store (select |v_#memory_int_315| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_73| (select (select |v_#memory_int_316| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_73|))) |v_#memory_int_316|) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_73| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53|) 1) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67|) 1) (= |#memory_int| (store |v_#memory_int_316| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53| (store (select |v_#memory_int_316| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_53|) 0)))) (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_73|) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_73| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_67| 0))))) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_main_~count~0#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))))' at error location [2023-12-02 16:10:08,189 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:10:08,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:10:08,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 50 [2023-12-02 16:10:08,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399478542] [2023-12-02 16:10:08,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:10:08,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 16:10:08,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:10:08,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 16:10:08,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=8071, Unknown=18, NotChecked=0, Total=8372 [2023-12-02 16:10:08,191 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand has 51 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 42 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 16:10:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:10:20,214 INFO L93 Difference]: Finished difference Result 181 states and 210 transitions. [2023-12-02 16:10:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 16:10:20,215 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 42 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2023-12-02 16:10:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:10:20,216 INFO L225 Difference]: With dead ends: 181 [2023-12-02 16:10:20,216 INFO L226 Difference]: Without dead ends: 181 [2023-12-02 16:10:20,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2449 ImplicationChecksByTransitivity, 53.8s TimeCoverageRelationStatistics Valid=467, Invalid=11502, Unknown=21, NotChecked=0, Total=11990 [2023-12-02 16:10:20,217 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 435 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 2797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 2827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:10:20,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1561 Invalid, 2827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2797 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-12-02 16:10:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-02 16:10:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 121. [2023-12-02 16:10:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 94 states have (on average 1.425531914893617) internal successors, (134), 114 states have internal predecessors, (134), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 16:10:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 144 transitions. [2023-12-02 16:10:20,222 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 144 transitions. Word has length 44 [2023-12-02 16:10:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:10:20,223 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 144 transitions. [2023-12-02 16:10:20,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 42 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 16:10:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 144 transitions. [2023-12-02 16:10:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 16:10:20,224 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:10:20,224 INFO L195 NwaCegarLoop]: trace histogram [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-12-02 16:10:20,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 16:10:20,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 16:10:20,424 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:10:20,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:10:20,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1259433768, now seen corresponding path program 1 times [2023-12-02 16:10:20,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:10:20,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060662527] [2023-12-02 16:10:20,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:10:20,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:10:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:10:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:10:22,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:10:22,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060662527] [2023-12-02 16:10:22,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060662527] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:10:22,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493504814] [2023-12-02 16:10:22,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:10:22,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:10:22,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:10:22,436 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:10:22,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 16:10:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:10:22,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 108 conjunts are in the unsatisfiable core [2023-12-02 16:10:22,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:10:22,756 INFO L378 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-12-02 16:10:23,607 INFO L378 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-12-02 16:10:23,613 INFO L378 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-12-02 16:10:23,619 INFO L378 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-12-02 16:10:24,068 INFO L378 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-12-02 16:10:24,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:10:24,232 INFO L378 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-12-02 16:10:24,259 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:10:24,260 INFO L378 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-12-02 16:10:24,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:10:24,279 INFO L378 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-12-02 16:10:25,305 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:10:25,305 INFO L378 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 72 treesize of output 46 [2023-12-02 16:10:25,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:10:25,316 INFO L378 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 27 treesize of output 22 [2023-12-02 16:10:25,344 INFO L378 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-12-02 16:10:25,575 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 16:10:25,575 INFO L378 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 152 treesize of output 103 [2023-12-02 16:10:25,589 INFO L378 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 55 treesize of output 19 [2023-12-02 16:10:25,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:10:25,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:10:25,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-12-02 16:10:26,223 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:10:26,223 INFO L378 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 35 [2023-12-02 16:10:26,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:10:26,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 16:10:26,480 INFO L378 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 7 [2023-12-02 16:10:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:10:26,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:10:28,861 INFO L349 Elim1Store]: treesize reduction 485, result has 50.6 percent of original size [2023-12-02 16:10:28,862 INFO L378 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 2 case distinctions, treesize of input 1390 treesize of output 1638 [2023-12-02 16:10:28,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:10:28,907 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 1929 treesize of output 1929 [2023-12-02 16:10:28,931 INFO L378 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 1925 treesize of output 1562 [2023-12-02 16:10:28,961 INFO L378 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 125 treesize of output 4 [2023-12-02 16:10:29,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:10:29,175 INFO L378 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 641 treesize of output 641 [2023-12-02 16:10:30,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493504814] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:10:30,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1275041043] [2023-12-02 16:10:30,764 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2023-12-02 16:10:30,764 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:10:30,764 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:10:30,764 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:10:30,765 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:10:31,837 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:10:31,855 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:10:48,562 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10728#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 1) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_79| Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72| Int) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56| Int) (|v_#memory_int_337| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_415| (Array Int (Array Int Int))) (|v_#memory_int_336| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_398| (Array Int (Array Int Int)))) (and (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_79|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72| (store (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_79| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56| (store (select (store |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72| (store (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_79| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56|) 0)))) (= |#memory_int| (store |v_#memory_int_337| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56| (store (select |v_#memory_int_337| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72|) 1) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_79| 0))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56|)) (= (store |v_#memory_int_336| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72| (store (select |v_#memory_int_336| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_79| (select (select |v_#memory_int_337| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_79|))) |v_#memory_int_337|) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_79| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56|) 1) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_415| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72| (store (select |v_#memory_$Pointer$.base_415| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_79| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56| (store (select (store |v_#memory_$Pointer$.base_415| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72| (store (select |v_#memory_$Pointer$.base_415| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_72|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_79| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_56|) 0)))))) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= 5 (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:10:48,562 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:10:48,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:10:48,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2023-12-02 16:10:48,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983754779] [2023-12-02 16:10:48,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:10:48,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 16:10:48,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:10:48,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 16:10:48,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=5883, Unknown=16, NotChecked=0, Total=6162 [2023-12-02 16:10:48,564 INFO L87 Difference]: Start difference. First operand 121 states and 144 transitions. Second operand has 42 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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-12-02 16:10:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:10:54,694 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2023-12-02 16:10:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 16:10:54,694 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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 45 [2023-12-02 16:10:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:10:54,695 INFO L225 Difference]: With dead ends: 137 [2023-12-02 16:10:54,695 INFO L226 Difference]: Without dead ends: 137 [2023-12-02 16:10:54,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2234 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=405, Invalid=7949, Unknown=18, NotChecked=0, Total=8372 [2023-12-02 16:10:54,696 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 254 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:10:54,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1243 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-02 16:10:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-02 16:10:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2023-12-02 16:10:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 115 states have internal predecessors, (134), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 16:10:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2023-12-02 16:10:54,700 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 45 [2023-12-02 16:10:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:10:54,700 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2023-12-02 16:10:54,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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-12-02 16:10:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2023-12-02 16:10:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 16:10:54,701 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:10:54,702 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:10:54,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 16:10:54,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:10:54,902 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:10:54,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:10:54,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1293812582, now seen corresponding path program 1 times [2023-12-02 16:10:54,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:10:54,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854077616] [2023-12-02 16:10:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:10:54,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:10:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:10:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:10:55,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:10:55,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854077616] [2023-12-02 16:10:55,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854077616] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:10:55,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408871637] [2023-12-02 16:10:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:10:55,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:10:55,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:10:55,212 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:10:55,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 16:10:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:10:55,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 16:10:55,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:10:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:10:55,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:10:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:10:55,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408871637] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:10:55,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [323627390] [2023-12-02 16:10:55,841 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2023-12-02 16:10:55,841 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:10:55,841 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:10:55,842 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:10:55,842 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:10:56,863 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:10:56,881 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:11:05,098 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11322#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#memory_$Pointer$.offset_423| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_85| Int) (|v_#memory_$Pointer$.base_440| (Array Int (Array Int Int))) (|v_#memory_int_362| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78| Int) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60| Int) (|v_#memory_int_361| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_423| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78| (store (select |v_#memory_$Pointer$.offset_423| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_85| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60| (store (select (store |v_#memory_$Pointer$.offset_423| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78| (store (select |v_#memory_$Pointer$.offset_423| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_85| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60|) 0)))) (= |#memory_int| (store |v_#memory_int_362| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60| (store (select |v_#memory_int_362| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60|) 0)))) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_85| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78| 0))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78|) 1) (= (store |v_#memory_int_361| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78| (store (select |v_#memory_int_361| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_85| (select (select |v_#memory_int_362| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_85|))) |v_#memory_int_362|) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60|)) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_85| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78|)) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_440| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78| (store (select |v_#memory_$Pointer$.base_440| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_85| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60| (store (select (store |v_#memory_$Pointer$.base_440| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78| (store (select |v_#memory_$Pointer$.base_440| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_78|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_85| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_60|) 1) (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_85|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:11:05,098 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:11:05,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:11:05,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2023-12-02 16:11:05,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254924019] [2023-12-02 16:11:05,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:11:05,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 16:11:05,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:11:05,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 16:11:05,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1605, Unknown=7, NotChecked=0, Total=1892 [2023-12-02 16:11:05,100 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-02 16:11:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:11:05,594 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2023-12-02 16:11:05,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 16:11:05,595 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 45 [2023-12-02 16:11:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:11:05,596 INFO L225 Difference]: With dead ends: 103 [2023-12-02 16:11:05,596 INFO L226 Difference]: Without dead ends: 103 [2023-12-02 16:11:05,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=361, Invalid=1984, Unknown=7, NotChecked=0, Total=2352 [2023-12-02 16:11:05,597 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 191 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:11:05,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 391 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:11:05,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-02 16:11:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2023-12-02 16:11:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 92 states have internal predecessors, (100), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 16:11:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2023-12-02 16:11:05,601 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 45 [2023-12-02 16:11:05,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:11:05,601 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2023-12-02 16:11:05,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-02 16:11:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2023-12-02 16:11:05,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 16:11:05,602 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:11:05,602 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:11:05,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 16:11:05,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-12-02 16:11:05,803 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:11:05,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:11:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash -192711382, now seen corresponding path program 2 times [2023-12-02 16:11:05,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:11:05,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604869410] [2023-12-02 16:11:05,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:11:05,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:11:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:11:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 16:11:05,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:11:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604869410] [2023-12-02 16:11:05,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604869410] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:11:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849105766] [2023-12-02 16:11:05,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:11:05,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:11:05,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:11:05,894 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:11:05,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 16:11:06,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 16:11:06,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:11:06,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 16:11:06,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:11:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 16:11:06,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:11:06,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849105766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:11:06,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:11:06,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-02 16:11:06,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379497379] [2023-12-02 16:11:06,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:11:06,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:11:06,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:11:06,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:11:06,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:11:06,829 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 16:11:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:11:06,909 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2023-12-02 16:11:06,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:11:06,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2023-12-02 16:11:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:11:06,911 INFO L225 Difference]: With dead ends: 73 [2023-12-02 16:11:06,911 INFO L226 Difference]: Without dead ends: 73 [2023-12-02 16:11:06,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:11:06,912 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:11:06,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 114 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:11:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-02 16:11:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-02 16:11:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 68 states have internal predecessors, (73), 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-12-02 16:11:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2023-12-02 16:11:06,915 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 49 [2023-12-02 16:11:06,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:11:06,915 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2023-12-02 16:11:06,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 16:11:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2023-12-02 16:11:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 16:11:06,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:11:06,916 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:11:06,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 16:11:07,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:11:07,117 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:11:07,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:11:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1774600388, now seen corresponding path program 1 times [2023-12-02 16:11:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:11:07,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006326939] [2023-12-02 16:11:07,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:11:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:11:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:11:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:11:12,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:11:12,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006326939] [2023-12-02 16:11:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006326939] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:11:12,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111405187] [2023-12-02 16:11:12,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:11:12,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:11:12,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:11:12,602 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:11:12,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-02 16:11:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:11:12,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 156 conjunts are in the unsatisfiable core [2023-12-02 16:11:12,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:11:13,000 INFO L378 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-12-02 16:11:13,148 INFO L378 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-12-02 16:11:14,527 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:11:14,527 INFO L378 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 18 treesize of output 17 [2023-12-02 16:11:14,546 INFO L378 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 7 treesize of output 3 [2023-12-02 16:11:14,586 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:11:14,587 INFO L378 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-12-02 16:11:15,072 INFO L378 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-12-02 16:11:15,088 INFO L378 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 22 treesize of output 17 [2023-12-02 16:11:15,134 INFO L378 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 15 treesize of output 1 [2023-12-02 16:11:15,466 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 16:11:15,467 INFO L378 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 142 treesize of output 93 [2023-12-02 16:11:15,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:11:15,483 INFO L378 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 65 treesize of output 29 [2023-12-02 16:11:15,494 INFO L378 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 29 [2023-12-02 16:11:15,817 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:11:15,818 INFO L378 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 73 treesize of output 36 [2023-12-02 16:11:15,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 3 [2023-12-02 16:11:15,831 INFO L378 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-12-02 16:11:15,838 INFO L378 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-12-02 16:11:16,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:11:16,622 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 16:11:16,622 INFO L378 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 81 treesize of output 62 [2023-12-02 16:11:16,681 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 16:11:16,681 INFO L378 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-12-02 16:11:16,707 INFO L378 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 34 treesize of output 29 [2023-12-02 16:11:16,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:11:16,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:11:16,720 INFO L378 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 41 treesize of output 39 [2023-12-02 16:11:18,706 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 16:11:18,706 INFO L378 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 147 treesize of output 77 [2023-12-02 16:11:18,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:11:18,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2023-12-02 16:11:18,739 INFO L378 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 26 treesize of output 13 [2023-12-02 16:11:19,159 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2023-12-02 16:11:19,159 INFO L378 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 282 treesize of output 137 [2023-12-02 16:11:19,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:11:19,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:11:19,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 129 [2023-12-02 16:11:19,200 INFO L378 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 74 treesize of output 53 [2023-12-02 16:11:20,683 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-12-02 16:11:20,684 INFO L378 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 67 [2023-12-02 16:11:20,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:11:20,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:11:20,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2023-12-02 16:11:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:11:21,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:11:27,819 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3384 (Array Int Int)) (v_ArrVal_3387 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_79| Int) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int)) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_79| v_ArrVal_3401))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_79| v_ArrVal_3402))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse4 (let ((.cse13 (select .cse12 .cse0))) (let ((.cse11 (store .cse13 .cse10 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 .cse11) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_79| (store (select (store .cse12 .cse0 .cse11) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_79|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse13 .cse10)))))) (.cse1 (let ((.cse9 (select .cse8 .cse0))) (let ((.cse7 (store .cse9 .cse10 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_79|))) (store (store |c_#memory_$Pointer$.base| .cse0 .cse7) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_79| (store (select (store .cse8 .cse0 .cse7) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_79|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse9 .cse10))))))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (select (select .cse4 .cse5) .cse6))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3384) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_79| v_ArrVal_3387) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))))) (< .cse10 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_79| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_79|) 0)))))) is different from false [2023-12-02 16:11:27,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111405187] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:11:27,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2110753946] [2023-12-02 16:11:27,826 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2023-12-02 16:11:27,827 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:11:27,827 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:11:27,827 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:11:27,827 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:11:28,995 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:11:29,019 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:11:52,287 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12138#(and (exists ((|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63| Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84| Int) (|v_#memory_$Pointer$.offset_447| (Array Int (Array Int Int))) (|v_#memory_int_389| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_91| Int) (|v_#memory_int_388| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_464| (Array Int (Array Int Int)))) (and (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_91| 0))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_447| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84| (store (select |v_#memory_$Pointer$.offset_447| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_91| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63| (store (select (store |v_#memory_$Pointer$.offset_447| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84| (store (select |v_#memory_$Pointer$.offset_447| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_91| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63|) 1) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84|) 1) (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_91|) (= (store (store |v_#memory_$Pointer$.base_464| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84| (store (select |v_#memory_$Pointer$.base_464| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63| (store (select (store |v_#memory_$Pointer$.base_464| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84| (store (select |v_#memory_$Pointer$.base_464| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63|) 0))) |#memory_$Pointer$.base|) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63|)) (= (store |v_#memory_int_388| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84| (store (select |v_#memory_int_388| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_91| (select (select |v_#memory_int_389| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_91|))) |v_#memory_int_389|) (= (store |v_#memory_int_389| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63| (store (select |v_#memory_int_389| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_63|) 0))) |#memory_int|) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_91| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_84|)))) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~ptr~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 1) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_main_~count~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))))' at error location [2023-12-02 16:11:52,287 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:11:52,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:11:52,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 58 [2023-12-02 16:11:52,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898978359] [2023-12-02 16:11:52,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:11:52,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 16:11:52,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:11:52,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 16:11:52,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9370, Unknown=41, NotChecked=194, Total=9900 [2023-12-02 16:11:52,289 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 58 states, 48 states have (on average 1.6875) internal successors, (81), 48 states have internal predecessors, (81), 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-12-02 16:12:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:12:04,168 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2023-12-02 16:12:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 16:12:04,169 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 48 states have (on average 1.6875) internal successors, (81), 48 states have internal predecessors, (81), 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-12-02 16:12:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:12:04,170 INFO L225 Difference]: With dead ends: 73 [2023-12-02 16:12:04,170 INFO L226 Difference]: Without dead ends: 73 [2023-12-02 16:12:04,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 45.1s TimeCoverageRelationStatistics Valid=470, Invalid=13769, Unknown=45, NotChecked=236, Total=14520 [2023-12-02 16:12:04,171 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 126 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 2366 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:12:04,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1468 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2366 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-12-02 16:12:04,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-02 16:12:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-02 16:12:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 68 states have internal predecessors, (72), 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-12-02 16:12:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2023-12-02 16:12:04,173 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 48 [2023-12-02 16:12:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:12:04,173 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2023-12-02 16:12:04,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 48 states have (on average 1.6875) internal successors, (81), 48 states have internal predecessors, (81), 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-12-02 16:12:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2023-12-02 16:12:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 16:12:04,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:12:04,174 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:12:04,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-12-02 16:12:04,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:12:04,374 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:12:04,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:12:04,375 INFO L85 PathProgramCache]: Analyzing trace with hash -818928710, now seen corresponding path program 1 times [2023-12-02 16:12:04,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:12:04,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136423837] [2023-12-02 16:12:04,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:12:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:12:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:12:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:12:08,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:12:08,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136423837] [2023-12-02 16:12:08,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136423837] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:12:08,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547033404] [2023-12-02 16:12:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:12:08,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:12:08,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:12:08,021 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:12:08,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 16:12:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:12:08,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 144 conjunts are in the unsatisfiable core [2023-12-02 16:12:08,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:12:08,275 INFO L378 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-12-02 16:12:09,159 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:12:09,159 INFO L378 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-12-02 16:12:09,585 INFO L378 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-12-02 16:12:09,600 INFO L378 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-12-02 16:12:09,931 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-02 16:12:09,931 INFO L378 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 85 treesize of output 47 [2023-12-02 16:12:09,948 INFO L378 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 36 treesize of output 15 [2023-12-02 16:12:10,203 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 16:12:10,203 INFO L378 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 36 [2023-12-02 16:12:10,211 INFO L378 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-12-02 16:12:10,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:10,220 INFO L378 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 16:12:10,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:10,844 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 16:12:10,844 INFO L378 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 71 [2023-12-02 16:12:10,903 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 16:12:10,904 INFO L378 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-12-02 16:12:10,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:10,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:10,926 INFO L378 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 27 treesize of output 25 [2023-12-02 16:12:12,729 INFO L349 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-12-02 16:12:12,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 74 [2023-12-02 16:12:12,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:12,767 INFO L378 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 0 case distinctions, treesize of input 38 treesize of output 25 [2023-12-02 16:12:13,133 INFO L349 Elim1Store]: treesize reduction 72, result has 23.4 percent of original size [2023-12-02 16:12:13,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 79 [2023-12-02 16:12:13,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:13,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:13,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:13,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2023-12-02 16:12:14,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:14,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:14,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:14,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 10 [2023-12-02 16:12:15,056 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2023-12-02 16:12:15,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 43 [2023-12-02 16:12:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:12:15,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:12:15,350 INFO L349 Elim1Store]: treesize reduction 5, result has 98.8 percent of original size [2023-12-02 16:12:15,350 INFO L378 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 432 treesize of output 431 [2023-12-02 16:12:16,942 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_84| Int) (v_ArrVal_3560 (Array Int Int)) (v_ArrVal_3561 (Array Int Int))) (or (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_84| v_ArrVal_3561))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= (let ((.cse12 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_84| v_ArrVal_3560))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse3 (let ((.cse13 (select .cse12 .cse6))) (let ((.cse11 (store .cse13 .cse10 0))) (store (store |c_#memory_$Pointer$.offset| .cse6 .cse11) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_84| (store (select (store .cse12 .cse6 .cse11) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_84|) 0 (select .cse13 .cse10)))))) (.cse0 (let ((.cse9 (select .cse8 .cse6))) (let ((.cse7 (store .cse9 .cse10 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_84|))) (store (store |c_#memory_$Pointer$.base| .cse6 .cse7) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_84| (store (select (store .cse8 .cse6 .cse7) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_84|) 0 (select .cse9 .cse10))))))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (select (select .cse3 .cse4) .cse5))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) .cse6))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_84| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_84|) 0)))) is different from false [2023-12-02 16:12:16,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547033404] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:12:16,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [297088672] [2023-12-02 16:12:16,948 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2023-12-02 16:12:16,948 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:12:16,949 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:12:16,949 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:12:16,949 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:12:18,173 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2023-12-02 16:12:18,194 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:12:36,585 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12637#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 2 |ULTIMATE.start_main_~count~0#1|) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:12:36,585 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:12:36,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:12:36,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 53 [2023-12-02 16:12:36,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015159482] [2023-12-02 16:12:36,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:12:36,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-02 16:12:36,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:12:36,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-02 16:12:36,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=8243, Unknown=15, NotChecked=182, Total=8742 [2023-12-02 16:12:36,587 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 54 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 46 states have internal predecessors, (82), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 16:12:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:12:44,672 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2023-12-02 16:12:44,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 16:12:44,672 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 46 states have internal predecessors, (82), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2023-12-02 16:12:44,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:12:44,673 INFO L225 Difference]: With dead ends: 121 [2023-12-02 16:12:44,673 INFO L226 Difference]: Without dead ends: 121 [2023-12-02 16:12:44,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3380 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=483, Invalid=12161, Unknown=16, NotChecked=222, Total=12882 [2023-12-02 16:12:44,674 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 280 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:12:44,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 757 Invalid, 1926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-02 16:12:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-02 16:12:44,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 76. [2023-12-02 16:12:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 71 states have internal predecessors, (77), 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-12-02 16:12:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2023-12-02 16:12:44,677 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 49 [2023-12-02 16:12:44,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:12:44,677 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2023-12-02 16:12:44,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 46 states have internal predecessors, (82), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 16:12:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2023-12-02 16:12:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 16:12:44,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:12:44,678 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:12:44,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 16:12:44,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:12:44,879 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:12:44,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:12:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash -818928709, now seen corresponding path program 1 times [2023-12-02 16:12:44,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:12:44,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676979220] [2023-12-02 16:12:44,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:12:44,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:12:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:12:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:12:48,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:12:48,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676979220] [2023-12-02 16:12:48,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676979220] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:12:48,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36230631] [2023-12-02 16:12:48,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:12:48,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:12:48,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:12:48,797 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:12:48,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 16:12:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:12:49,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 150 conjunts are in the unsatisfiable core [2023-12-02 16:12:49,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:12:49,196 INFO L378 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-12-02 16:12:50,028 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:12:50,029 INFO L378 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-12-02 16:12:50,446 INFO L378 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-12-02 16:12:50,457 INFO L378 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-12-02 16:12:50,786 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-02 16:12:50,786 INFO L378 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 88 treesize of output 50 [2023-12-02 16:12:50,818 INFO L378 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 30 [2023-12-02 16:12:51,147 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 16:12:51,148 INFO L378 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 43 [2023-12-02 16:12:51,156 INFO L378 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-12-02 16:12:51,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:51,171 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:12:51,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 16:12:51,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:51,792 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 16:12:51,792 INFO L378 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 80 [2023-12-02 16:12:51,852 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 16:12:51,852 INFO L378 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-12-02 16:12:51,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:51,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:51,881 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 16:12:51,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2023-12-02 16:12:53,694 INFO L349 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-12-02 16:12:53,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 140 treesize of output 76 [2023-12-02 16:12:53,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:53,718 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:12:53,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-12-02 16:12:54,081 INFO L349 Elim1Store]: treesize reduction 84, result has 20.8 percent of original size [2023-12-02 16:12:54,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 182 treesize of output 100 [2023-12-02 16:12:54,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:54,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:54,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:54,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:54,128 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-12-02 16:12:54,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2023-12-02 16:12:56,140 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2023-12-02 16:12:56,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 62 [2023-12-02 16:12:56,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:56,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:12:56,163 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:12:56,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 16:12:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:12:56,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:13:00,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36230631] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:13:00,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [61291136] [2023-12-02 16:13:00,230 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2023-12-02 16:13:00,230 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:13:00,230 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:13:00,230 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:13:00,231 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:13:01,458 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:13:01,485 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:13:22,671 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13193#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (or (< (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:13:22,671 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:13:22,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:13:22,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 54 [2023-12-02 16:13:22,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883261975] [2023-12-02 16:13:22,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:13:22,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-02 16:13:22,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:13:22,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-02 16:13:22,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=9533, Unknown=22, NotChecked=0, Total=9900 [2023-12-02 16:13:22,674 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 54 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 46 states have internal predecessors, (82), 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-12-02 16:13:29,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:13:29,781 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2023-12-02 16:13:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 16:13:29,782 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 46 states have internal predecessors, (82), 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 49 [2023-12-02 16:13:29,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:13:29,783 INFO L225 Difference]: With dead ends: 67 [2023-12-02 16:13:29,783 INFO L226 Difference]: Without dead ends: 67 [2023-12-02 16:13:29,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4077 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=524, Invalid=13026, Unknown=22, NotChecked=0, Total=13572 [2023-12-02 16:13:29,785 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 125 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:13:29,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 816 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-02 16:13:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-02 16:13:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-12-02 16:13:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 62 states have internal predecessors, (64), 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-12-02 16:13:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2023-12-02 16:13:29,788 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 49 [2023-12-02 16:13:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:13:29,788 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2023-12-02 16:13:29,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 46 states have internal predecessors, (82), 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-12-02 16:13:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2023-12-02 16:13:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 16:13:29,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:13:29,789 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:13:29,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 16:13:29,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:13:29,990 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:13:29,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:13:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1291849920, now seen corresponding path program 1 times [2023-12-02 16:13:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:13:29,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656419420] [2023-12-02 16:13:29,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:13:29,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:13:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:13:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:13:30,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:13:30,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656419420] [2023-12-02 16:13:30,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656419420] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:13:30,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89439992] [2023-12-02 16:13:30,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:13:30,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:13:30,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:13:30,230 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:13:30,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-02 16:13:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:13:30,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 16:13:30,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:13:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:13:30,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:13:30,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89439992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:13:30,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:13:30,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2023-12-02 16:13:30,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880864749] [2023-12-02 16:13:30,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:13:30,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 16:13:30,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:13:30,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 16:13:30,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-02 16:13:30,747 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-12-02 16:13:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:13:30,938 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-12-02 16:13:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 16:13:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 52 [2023-12-02 16:13:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:13:30,939 INFO L225 Difference]: With dead ends: 63 [2023-12-02 16:13:30,940 INFO L226 Difference]: Without dead ends: 63 [2023-12-02 16:13:30,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-02 16:13:30,940 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 52 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:13:30,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 180 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:13:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-02 16:13:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-12-02 16:13:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.25) internal successors, (60), 58 states have internal predecessors, (60), 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-12-02 16:13:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2023-12-02 16:13:30,943 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 52 [2023-12-02 16:13:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:13:30,943 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2023-12-02 16:13:30,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-12-02 16:13:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2023-12-02 16:13:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 16:13:30,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:13:30,944 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:13:30,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-12-02 16:13:31,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-02 16:13:31,145 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:13:31,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:13:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1291743663, now seen corresponding path program 1 times [2023-12-02 16:13:31,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:13:31,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592567827] [2023-12-02 16:13:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:13:31,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:13:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:13:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:13:31,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:13:31,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592567827] [2023-12-02 16:13:31,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592567827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:13:31,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:13:31,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:13:31,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318047371] [2023-12-02 16:13:31,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:13:31,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:13:31,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:13:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:13:31,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:13:31,277 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-12-02 16:13:31,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:13:31,627 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2023-12-02 16:13:31,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:13:31,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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 52 [2023-12-02 16:13:31,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:13:31,628 INFO L225 Difference]: With dead ends: 78 [2023-12-02 16:13:31,628 INFO L226 Difference]: Without dead ends: 78 [2023-12-02 16:13:31,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:13:31,629 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 36 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:13:31,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 135 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:13:31,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-02 16:13:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2023-12-02 16:13:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 61 states have internal predecessors, (66), 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-12-02 16:13:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2023-12-02 16:13:31,631 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 52 [2023-12-02 16:13:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:13:31,631 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2023-12-02 16:13:31,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-12-02 16:13:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2023-12-02 16:13:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 16:13:31,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:13:31,632 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:13:31,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-02 16:13:31,632 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:13:31,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:13:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1291743662, now seen corresponding path program 1 times [2023-12-02 16:13:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:13:31,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140337007] [2023-12-02 16:13:31,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:13:31,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:13:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:13:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:13:31,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:13:31,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140337007] [2023-12-02 16:13:31,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140337007] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:13:31,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:13:31,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:13:31,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907497872] [2023-12-02 16:13:31,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:13:31,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:13:31,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:13:31,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:13:31,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:13:31,874 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-12-02 16:13:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:13:32,138 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2023-12-02 16:13:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:13:32,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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 52 [2023-12-02 16:13:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:13:32,139 INFO L225 Difference]: With dead ends: 65 [2023-12-02 16:13:32,139 INFO L226 Difference]: Without dead ends: 65 [2023-12-02 16:13:32,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:13:32,140 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 40 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:13:32,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 95 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:13:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-02 16:13:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-12-02 16:13:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.25) internal successors, (65), 60 states have internal predecessors, (65), 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-12-02 16:13:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2023-12-02 16:13:32,142 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 52 [2023-12-02 16:13:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:13:32,142 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2023-12-02 16:13:32,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-12-02 16:13:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2023-12-02 16:13:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 16:13:32,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:13:32,143 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:13:32,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-02 16:13:32,143 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:13:32,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:13:32,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1389313938, now seen corresponding path program 1 times [2023-12-02 16:13:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:13:32,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128710405] [2023-12-02 16:13:32,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:13:32,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:13:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:13:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:13:32,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:13:32,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128710405] [2023-12-02 16:13:32,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128710405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:13:32,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:13:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 16:13:32,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709321567] [2023-12-02 16:13:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:13:32,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:13:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:13:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:13:32,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:13:32,527 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 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-12-02 16:13:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:13:33,067 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2023-12-02 16:13:33,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 16:13:33,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 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 53 [2023-12-02 16:13:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:13:33,068 INFO L225 Difference]: With dead ends: 65 [2023-12-02 16:13:33,068 INFO L226 Difference]: Without dead ends: 65 [2023-12-02 16:13:33,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-02 16:13:33,069 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 72 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:13:33,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 116 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 16:13:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-02 16:13:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-12-02 16:13:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 60 states have internal predecessors, (64), 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-12-02 16:13:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2023-12-02 16:13:33,071 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 53 [2023-12-02 16:13:33,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:13:33,071 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2023-12-02 16:13:33,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 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-12-02 16:13:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2023-12-02 16:13:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 16:13:33,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:13:33,072 INFO L195 NwaCegarLoop]: trace histogram [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-12-02 16:13:33,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-02 16:13:33,072 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:13:33,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:13:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash -120035460, now seen corresponding path program 1 times [2023-12-02 16:13:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:13:33,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132520185] [2023-12-02 16:13:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:13:33,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:13:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:13:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:13:33,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:13:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132520185] [2023-12-02 16:13:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132520185] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:13:33,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:13:33,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 16:13:33,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161878898] [2023-12-02 16:13:33,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:13:33,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:13:33,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:13:33,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:13:33,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:13:33,329 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 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-12-02 16:13:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:13:33,796 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2023-12-02 16:13:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 16:13:33,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 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 54 [2023-12-02 16:13:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:13:33,797 INFO L225 Difference]: With dead ends: 73 [2023-12-02 16:13:33,797 INFO L226 Difference]: Without dead ends: 73 [2023-12-02 16:13:33,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-02 16:13:33,798 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:13:33,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 143 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 16:13:33,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-02 16:13:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2023-12-02 16:13:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 60 states have internal predecessors, (65), 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-12-02 16:13:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2023-12-02 16:13:33,800 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 54 [2023-12-02 16:13:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:13:33,800 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2023-12-02 16:13:33,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 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-12-02 16:13:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2023-12-02 16:13:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 16:13:33,801 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:13:33,801 INFO L195 NwaCegarLoop]: trace histogram [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-12-02 16:13:33,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-02 16:13:33,801 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:13:33,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:13:33,802 INFO L85 PathProgramCache]: Analyzing trace with hash -120035459, now seen corresponding path program 1 times [2023-12-02 16:13:33,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:13:33,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860029685] [2023-12-02 16:13:33,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:13:33,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:13:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:13:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:13:34,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:13:34,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860029685] [2023-12-02 16:13:34,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860029685] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:13:34,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:13:34,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 16:13:34,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988391921] [2023-12-02 16:13:34,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:13:34,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:13:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:13:34,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:13:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:13:34,151 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 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-12-02 16:13:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:13:34,685 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2023-12-02 16:13:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 16:13:34,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 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 54 [2023-12-02 16:13:34,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:13:34,687 INFO L225 Difference]: With dead ends: 72 [2023-12-02 16:13:34,687 INFO L226 Difference]: Without dead ends: 72 [2023-12-02 16:13:34,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-02 16:13:34,688 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 72 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:13:34,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 122 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 16:13:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-02 16:13:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2023-12-02 16:13:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 60 states have internal predecessors, (64), 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-12-02 16:13:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2023-12-02 16:13:34,690 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 54 [2023-12-02 16:13:34,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:13:34,690 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2023-12-02 16:13:34,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 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-12-02 16:13:34,690 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2023-12-02 16:13:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 16:13:34,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:13:34,691 INFO L195 NwaCegarLoop]: trace histogram [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-12-02 16:13:34,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-02 16:13:34,691 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:13:34,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:13:34,691 INFO L85 PathProgramCache]: Analyzing trace with hash -120032968, now seen corresponding path program 1 times [2023-12-02 16:13:34,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:13:34,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685321563] [2023-12-02 16:13:34,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:13:34,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:13:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:13:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:13:36,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:13:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685321563] [2023-12-02 16:13:36,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685321563] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:13:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110398470] [2023-12-02 16:13:36,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:13:36,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:13:36,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:13:36,013 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:13:36,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 16:13:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:13:36,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 16:13:36,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:13:37,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:13:37,023 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2023-12-02 16:13:37,751 INFO L349 Elim1Store]: treesize reduction 12, result has 85.9 percent of original size [2023-12-02 16:13:37,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 122 [2023-12-02 16:13:37,948 INFO L349 Elim1Store]: treesize reduction 12, result has 83.6 percent of original size [2023-12-02 16:13:37,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 126 [2023-12-02 16:13:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:13:38,961 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:13:38,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110398470] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:13:38,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:13:38,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [19] total 30 [2023-12-02 16:13:38,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002252748] [2023-12-02 16:13:38,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:13:38,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 16:13:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:13:38,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 16:13:38,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2023-12-02 16:13:38,962 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-12-02 16:13:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:13:40,323 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2023-12-02 16:13:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 16:13:40,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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 54 [2023-12-02 16:13:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:13:40,325 INFO L225 Difference]: With dead ends: 62 [2023-12-02 16:13:40,325 INFO L226 Difference]: Without dead ends: 62 [2023-12-02 16:13:40,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=130, Invalid=1202, Unknown=0, NotChecked=0, Total=1332 [2023-12-02 16:13:40,325 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 145 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 16:13:40,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 158 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 16:13:40,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-02 16:13:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-02 16:13:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.16) internal successors, (58), 57 states have internal predecessors, (58), 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-12-02 16:13:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2023-12-02 16:13:40,327 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 54 [2023-12-02 16:13:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:13:40,327 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2023-12-02 16:13:40,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-12-02 16:13:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2023-12-02 16:13:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 16:13:40,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:13:40,328 INFO L195 NwaCegarLoop]: trace histogram [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-12-02 16:13:40,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 16:13:40,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-12-02 16:13:40,529 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:13:40,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:13:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 573870181, now seen corresponding path program 1 times [2023-12-02 16:13:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:13:40,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035915612] [2023-12-02 16:13:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:13:40,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:13:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:13:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:13:42,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:13:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035915612] [2023-12-02 16:13:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035915612] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:13:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27812093] [2023-12-02 16:13:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:13:42,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:13:42,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:13:42,925 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:13:42,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 16:13:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:13:43,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 106 conjunts are in the unsatisfiable core [2023-12-02 16:13:43,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:13:43,355 INFO L378 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-12-02 16:13:44,059 INFO L378 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-12-02 16:13:44,065 INFO L378 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-12-02 16:13:44,071 INFO L378 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-12-02 16:13:44,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:13:44,313 INFO L378 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-12-02 16:13:44,335 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:13:44,335 INFO L378 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-12-02 16:13:44,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:13:44,353 INFO L378 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-12-02 16:13:45,488 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:13:45,488 INFO L378 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 67 treesize of output 45 [2023-12-02 16:13:45,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:13:45,514 INFO L378 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 0 case distinctions, treesize of input 38 treesize of output 25 [2023-12-02 16:13:45,726 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 16:13:45,727 INFO L378 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 113 treesize of output 82 [2023-12-02 16:13:45,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:13:45,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:13:45,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 25 [2023-12-02 16:13:46,380 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:13:46,381 INFO L378 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 57 treesize of output 28 [2023-12-02 16:13:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:13:46,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:13:46,885 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4479 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4479) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 0)) is different from false [2023-12-02 16:13:47,612 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4479 (Array Int Int))) (= (let ((.cse0 (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4479) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 0)) is different from false [2023-12-02 16:13:47,634 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4479 (Array Int Int))) (= (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (let ((.cse4 (select |c_#memory_$Pointer$.offset| .cse1))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse1 (store .cse4 .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse4 .cse2))))))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4479) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 0)) is different from false [2023-12-02 16:13:47,656 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4479 (Array Int Int))) (= (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (let ((.cse4 (select |c_#memory_$Pointer$.offset| .cse1))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse1 (store .cse4 .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse4 .cse2))))))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_4479) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 0)) is different from false [2023-12-02 16:13:48,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27812093] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:13:48,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1710945470] [2023-12-02 16:13:48,115 INFO L159 IcfgInterpreter]: Started Sifa with 44 locations of interest [2023-12-02 16:13:48,115 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:13:48,115 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:13:48,115 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:13:48,115 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:13:49,451 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:13:49,469 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:14:14,960 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15049#(and (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) |ULTIMATE.start_main_~ptr~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 1) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) 1) (or (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.base| 0)) (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0))) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 3) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |ULTIMATE.start_sll_circular_destroy_~q~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) 1) (= |ULTIMATE.start_main_#t~mem29#1.offset| |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_#t~mem29#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) 4)) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_#t~mem29#1.base| |ULTIMATE.start_sll_circular_destroy_#in~head#1.base|) (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) 1) (exists ((|v_#memory_int_437| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_110| Int) (|v_#memory_int_436| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_517| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_534| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101| Int) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72| Int)) (and (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_110| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101| 0))) (= |#memory_int| (store |v_#memory_int_437| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72| (store (select |v_#memory_int_437| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101|) 1) (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_110|) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_110| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101|)) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_534| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101| (store (select |v_#memory_$Pointer$.base_534| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72| (store (select (store |v_#memory_$Pointer$.base_534| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101| (store (select |v_#memory_$Pointer$.base_534| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72|) 0)))) (= (store |v_#memory_int_436| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101| (store (select |v_#memory_int_436| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_110| (select (select |v_#memory_int_437| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_110|))) |v_#memory_int_437|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_517| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101| (store (select |v_#memory_$Pointer$.offset_517| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_110| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72| (store (select (store |v_#memory_$Pointer$.offset_517| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101| (store (select |v_#memory_$Pointer$.offset_517| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_101|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_110| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72|) 1) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_72|)))) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |ULTIMATE.start_sll_circular_destroy_~q~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_#t~mem29#1.base|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))))' at error location [2023-12-02 16:14:14,960 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:14:14,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:14:14,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 38 [2023-12-02 16:14:14,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161973254] [2023-12-02 16:14:14,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:14:14,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 16:14:14,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:14:14,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 16:14:14,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=6463, Unknown=50, NotChecked=660, Total=7482 [2023-12-02 16:14:14,962 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 39 states, 33 states have (on average 2.696969696969697) internal successors, (89), 34 states have internal predecessors, (89), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:14:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:14:19,291 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2023-12-02 16:14:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 16:14:19,291 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 2.696969696969697) internal successors, (89), 34 states have internal predecessors, (89), 4 states have call successors, (6), 2 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-12-02 16:14:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:14:19,292 INFO L225 Difference]: With dead ends: 62 [2023-12-02 16:14:19,292 INFO L226 Difference]: Without dead ends: 62 [2023-12-02 16:14:19,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2931 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=442, Invalid=8640, Unknown=54, NotChecked=764, Total=9900 [2023-12-02 16:14:19,293 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 166 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:14:19,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 388 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-02 16:14:19,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-02 16:14:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-02 16:14:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 57 states have internal predecessors, (58), 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-12-02 16:14:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2023-12-02 16:14:19,296 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 55 [2023-12-02 16:14:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:14:19,297 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2023-12-02 16:14:19,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 2.696969696969697) internal successors, (89), 34 states have internal predecessors, (89), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:14:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2023-12-02 16:14:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-02 16:14:19,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:14:19,298 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:14:19,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 16:14:19,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-12-02 16:14:19,498 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:14:19,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:14:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash 610106652, now seen corresponding path program 1 times [2023-12-02 16:14:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:14:19,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169529334] [2023-12-02 16:14:19,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:14:19,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:14:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:14:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:14:22,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:14:22,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169529334] [2023-12-02 16:14:22,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169529334] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:14:22,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010230399] [2023-12-02 16:14:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:14:22,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:14:22,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:14:22,146 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:14:22,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-12-02 16:14:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:14:22,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 95 conjunts are in the unsatisfiable core [2023-12-02 16:14:22,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:14:22,480 INFO L378 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-12-02 16:14:23,415 INFO L378 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-12-02 16:14:23,421 INFO L378 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-12-02 16:14:23,427 INFO L378 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-12-02 16:14:24,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:14:24,025 INFO L378 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-12-02 16:14:24,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:14:24,060 INFO L378 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-12-02 16:14:24,088 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:14:24,088 INFO L378 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-12-02 16:14:25,018 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:14:25,018 INFO L378 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 53 treesize of output 35 [2023-12-02 16:14:25,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:14:25,040 INFO L378 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-12-02 16:14:25,291 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 16:14:25,291 INFO L378 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 87 treesize of output 64 [2023-12-02 16:14:25,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:14:25,304 INFO L378 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 32 treesize of output 11 [2023-12-02 16:14:26,199 INFO L378 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-12-02 16:14:26,458 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:14:26,458 INFO L378 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 50 treesize of output 21 [2023-12-02 16:14:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:14:26,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:14:27,035 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4632 (Array Int Int)) (v_ArrVal_4633 (Array Int Int))) (< (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4632))) (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| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4633) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_#StackHeapBarrier|)) is different from false [2023-12-02 16:14:27,051 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4632 (Array Int Int)) (v_ArrVal_4633 (Array Int Int))) (< (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4632))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_4630) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4633) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_#StackHeapBarrier|)) is different from false [2023-12-02 16:14:27,092 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4632 (Array Int Int)) (v_ArrVal_4633 (Array Int Int))) (< (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4632))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_4630) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_4633) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_#StackHeapBarrier|)) is different from false [2023-12-02 16:14:27,621 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4632 (Array Int Int)) (v_ArrVal_4633 (Array Int Int))) (< (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_4632))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4630) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_4633) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_#StackHeapBarrier|)) is different from false [2023-12-02 16:14:28,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010230399] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:14:28,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [203896388] [2023-12-02 16:14:28,046 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2023-12-02 16:14:28,046 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:14:28,046 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:14:28,046 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:14:28,047 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:14:29,405 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:14:29,425 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:14:31,760 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse0 (exists ((|v_#valid_375| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_375| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 1)) (= 0 (select |v_#valid_375| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|))))) (.cse1 (exists ((|v_#length_302| (Array Int Int))) (= (store |v_#length_302| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 8) |c_#length|))) (.cse2 (exists ((|v_#memory_$Pointer$.base_551| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_551| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (store (select |v_#memory_$Pointer$.base_551| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4))) |c_#memory_$Pointer$.base|))) (.cse3 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|))) (.cse5 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse7 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse8 (exists ((|v_#length_301| (Array Int Int))) (and (= (select |v_#length_301| 1) 2) (= 23 (select |v_#length_301| 2))))) (.cse9 (<= (+ |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 1) |c_#StackHeapBarrier|)) (.cse10 (exists ((|v_#memory_$Pointer$.offset_534| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_534| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (store (select |v_#memory_$Pointer$.offset_534| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4))) |c_#memory_$Pointer$.offset|))) (.cse11 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)) (.cse12 (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 0))) (.cse13 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse14 (exists ((|v_#memory_int_448| (Array Int (Array Int Int))) (|v_#memory_int_447| (Array Int (Array Int Int)))) (let ((.cse17 (select |v_#memory_int_448| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|))) (and (= (store |v_#memory_int_447| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (select |v_#memory_int_447| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 (select .cse17 0))) |v_#memory_int_448|) (= (store |v_#memory_int_448| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store .cse17 4 1)) |c_#memory_int|))))) (.cse15 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((|v_old(#memory_int)_AFTER_CALL_288| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_old(#memory_int)_AFTER_CALL_288| 1))) (and (= (select .cse6 0) 48) (= (select .cse6 1) 0)))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (exists ((|v_old(#memory_int)_AFTER_CALL_287| (Array Int (Array Int Int)))) (let ((.cse16 (select |v_old(#memory_int)_AFTER_CALL_287| 1))) (and (= (select .cse16 1) 0) (= 48 (select .cse16 0))))) .cse11 .cse12 .cse13 .cse14 .cse15))) (= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~len#1| 2) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-12-02 16:14:56,669 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15551#(and (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) |ULTIMATE.start_main_~ptr~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 1) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_destroy_~q~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) 0)) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) 1) (or (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.base| 0)) (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0))) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) 0) |ULTIMATE.start_sll_circular_destroy_~q~0#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 3) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) 1) (= |ULTIMATE.start_main_#t~mem29#1.offset| |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= |#StackHeapBarrier| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_#t~mem29#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) 4)) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75| Int) (|v_#memory_$Pointer$.offset_539| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_556| (Array Int (Array Int Int))) (|v_#memory_int_452| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_117| Int) (|v_#memory_int_453| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107| Int)) (and (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_117|) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75|)) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_556| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107| (store (select |v_#memory_$Pointer$.base_556| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_117| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75| (store (select (store |v_#memory_$Pointer$.base_556| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107| (store (select |v_#memory_$Pointer$.base_556| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_117| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75|) 0)))) (= (store |v_#memory_int_452| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107| (store (select |v_#memory_int_452| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_117| (select (select |v_#memory_int_453| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_117|))) |v_#memory_int_453|) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107|) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_539| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107| (store (select |v_#memory_$Pointer$.offset_539| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_117| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75| (store (select (store |v_#memory_$Pointer$.offset_539| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107| (store (select |v_#memory_$Pointer$.offset_539| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_117| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75|) 0)))) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_117| 0))) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_117| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_107|)) (= |#memory_int| (store |v_#memory_int_453| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75| (store (select |v_#memory_int_453| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_75|) 1))) (= |ULTIMATE.start_main_#t~mem29#1.base| |ULTIMATE.start_sll_circular_destroy_#in~head#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) 1) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_#t~mem29#1.base|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)))))' at error location [2023-12-02 16:14:56,669 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:14:56,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:14:56,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 45 [2023-12-02 16:14:56,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978160427] [2023-12-02 16:14:56,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:14:56,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-02 16:14:56,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:14:56,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-02 16:14:56,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=7138, Unknown=49, NotChecked=870, Total=8372 [2023-12-02 16:14:56,671 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 46 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 38 states have internal predecessors, (93), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:15:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:15:01,350 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2023-12-02 16:15:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 16:15:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 38 states have internal predecessors, (93), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2023-12-02 16:15:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:15:01,352 INFO L225 Difference]: With dead ends: 62 [2023-12-02 16:15:01,352 INFO L226 Difference]: Without dead ends: 62 [2023-12-02 16:15:01,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 101 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2777 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=420, Invalid=9053, Unknown=53, NotChecked=980, Total=10506 [2023-12-02 16:15:01,353 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 123 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:15:01,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 421 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 16:15:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-02 16:15:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-02 16:15:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 57 states have internal predecessors, (58), 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-12-02 16:15:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2023-12-02 16:15:01,356 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 56 [2023-12-02 16:15:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:15:01,357 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2023-12-02 16:15:01,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 38 states have internal predecessors, (93), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:15:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2023-12-02 16:15:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 16:15:01,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:15:01,358 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:15:01,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-12-02 16:15:01,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-12-02 16:15:01,559 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:15:01,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:15:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash -614101846, now seen corresponding path program 1 times [2023-12-02 16:15:01,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:15:01,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161637780] [2023-12-02 16:15:01,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:15:01,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:15:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:15:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:15:06,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:15:06,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161637780] [2023-12-02 16:15:06,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161637780] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:15:06,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090152733] [2023-12-02 16:15:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:15:06,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:15:06,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:15:06,284 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:15:06,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 16:15:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:15:06,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 136 conjunts are in the unsatisfiable core [2023-12-02 16:15:06,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:15:07,637 INFO L378 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-12-02 16:15:07,643 INFO L378 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-12-02 16:15:07,649 INFO L378 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-12-02 16:15:07,661 INFO L378 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-12-02 16:15:08,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:15:08,311 INFO L378 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-12-02 16:15:08,335 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:15:08,336 INFO L378 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-12-02 16:15:08,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:15:08,356 INFO L378 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-12-02 16:15:09,521 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:15:09,522 INFO L378 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 56 treesize of output 38 [2023-12-02 16:15:09,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:15:09,546 INFO L378 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 27 treesize of output 22 [2023-12-02 16:15:09,848 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 16:15:09,848 INFO L378 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 111 treesize of output 80 [2023-12-02 16:15:09,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:15:09,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:15:09,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-12-02 16:15:11,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:15:11,342 INFO L378 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 1 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 16:15:14,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:15:14,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:15:14,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:15:14,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 36 [2023-12-02 16:15:14,088 INFO L349 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2023-12-02 16:15:14,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 105 treesize of output 54 [2023-12-02 16:15:14,536 INFO L378 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-12-02 16:15:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:15:14,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:15:16,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:15:16,537 INFO L378 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 61 treesize of output 65 [2023-12-02 16:15:23,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:15:23,321 INFO L378 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 3121 treesize of output 3126 [2023-12-02 16:15:28,394 WARN L876 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| 1)) (forall ((v_prenex_879 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| Int) (v_prenex_880 (Array Int Int)) (v_ArrVal_4788 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4789 (Array Int Int)) (v_ArrVal_4801 (Array Int Int)) (v_prenex_878 Int)) (let ((.cse13 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4801))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4800)) (.cse3 (select .cse13 .cse1))) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4789)) (.cse2 (select .cse9 .cse1))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| .cse1 (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4788)) (.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select .cse8 .cse7)) (.cse5 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select .cse10 .cse5))) (let ((.cse6 (select (select .cse12 .cse11) 0)) (.cse4 (select (select .cse8 .cse11) 0))) (or (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse3 v_prenex_878 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_prenex_880))) (select .cse0 (select (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store .cse2 v_prenex_878 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_prenex_879) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 0) .cse4) (< .cse5 0) (< .cse6 0) (not (= .cse7 (select (select .cse8 .cse4) .cse6))) (< (select (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120|) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| 0) (= .cse7 (select .cse10 0)) (not (= .cse4 .cse11)) (= .cse4 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|) (not (= (select (select .cse12 .cse7) .cse5) 0)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|) 0)) (forall ((v_prenex_879 (Array Int Int)) (v_prenex_880 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4801 (Array Int Int)) (v_prenex_878 Int)) (let ((.cse22 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4801))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4800)) (.cse21 (select (select .cse22 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| .cse21 (store (select .cse19 .cse21) v_prenex_878 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_prenex_879)) (.cse20 (store (store |c_#memory_$Pointer$.base| .cse21 (store (select .cse22 .cse21) v_prenex_878 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_prenex_880))) (let ((.cse15 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (select (select .cse20 .cse15) .cse16))) (let ((.cse18 (select (select .cse20 .cse17) 0))) (or (not (= (select (select .cse14 .cse15) .cse16) 0)) (not (= .cse17 .cse18)) (< v_prenex_878 0) (< .cse16 0) (not (= (select (select .cse14 .cse17) 0) 0)) (< (select (select .cse19 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_prenex_878) (= .cse16 0) (not (= .cse15 (select (select .cse20 .cse18) 0))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|) 0)) (forall ((v_prenex_879 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| Int) (v_prenex_880 (Array Int Int)) (v_ArrVal_4788 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4789 (Array Int Int)) (v_ArrVal_4801 (Array Int Int)) (v_prenex_878 Int)) (let ((.cse34 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4801))) (let ((.cse32 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4800)) (.cse28 (select (select .cse34 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse30 (select .cse34 .cse28)) (.cse29 (select .cse32 .cse28))) (let ((.cse23 (store (store |c_#memory_$Pointer$.offset| .cse28 (store .cse29 v_prenex_878 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_prenex_879)) (.cse33 (store (store |c_#memory_$Pointer$.base| .cse28 (store .cse30 v_prenex_878 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_prenex_880))) (let ((.cse24 (select (select .cse33 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse31 (select (select .cse33 .cse24) .cse25))) (let ((.cse26 (select (select .cse33 .cse31) 0))) (or (not (= (select (select .cse23 .cse24) .cse25) 0)) (= .cse26 (select (let ((.cse27 (store (store |c_#memory_$Pointer$.base| .cse28 (store .cse30 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4789))) (select .cse27 (select (select .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse28 (store .cse29 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4788) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 0)) (not (= .cse31 .cse26)) (< v_prenex_878 0) (< .cse25 0) (not (= (select (select .cse23 .cse31) 0) 0)) (< (select (select .cse32 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_prenex_878) (= .cse25 0) (not (= .cse24 (select (select .cse33 .cse26) 0)))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|) 0)) (forall ((v_prenex_879 (Array Int Int)) (v_prenex_880 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4801 (Array Int Int)) (v_prenex_878 Int)) (let ((.cse44 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4801))) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4800)) (.cse43 (select (select .cse44 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse35 (store (store |c_#memory_$Pointer$.offset| .cse43 (store (select .cse41 .cse43) v_prenex_878 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_prenex_879)) (.cse42 (store (store |c_#memory_$Pointer$.base| .cse43 (store (select .cse44 .cse43) v_prenex_878 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_prenex_880))) (let ((.cse36 (select (select .cse42 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse37 (select (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse38 (select (select .cse42 .cse36) .cse37))) (let ((.cse39 (select (select .cse42 .cse38) 0)) (.cse40 (select (select .cse35 .cse38) 0))) (or (not (= (select (select .cse35 .cse36) .cse37) 0)) (not (= .cse38 .cse39)) (< v_prenex_878 0) (< .cse37 0) (= .cse39 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|) (< .cse40 0) (< (select (select .cse41 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_prenex_878) (not (= (select (select .cse42 .cse39) .cse40) .cse36)) (= .cse37 0))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| Int)) (or (forall ((v_prenex_879 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| Int) (v_prenex_880 (Array Int Int)) (v_ArrVal_4788 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4789 (Array Int Int)) (v_ArrVal_4801 (Array Int Int)) (v_prenex_878 Int)) (let ((.cse57 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4801))) (let ((.cse55 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4800)) (.cse50 (select (select .cse57 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse52 (select .cse57 .cse50)) (.cse51 (select .cse55 .cse50))) (let ((.cse45 (store (store |c_#memory_$Pointer$.offset| .cse50 (store .cse51 v_prenex_878 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_prenex_879)) (.cse56 (store (store |c_#memory_$Pointer$.base| .cse50 (store .cse52 v_prenex_878 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_prenex_880))) (let ((.cse46 (select (select .cse56 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse47 (select (select .cse45 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse53 (select (select .cse56 .cse46) .cse47))) (let ((.cse48 (select (select .cse56 .cse53) 0)) (.cse54 (select (select .cse45 .cse53) 0))) (or (not (= (select (select .cse45 .cse46) .cse47) 0)) (= .cse48 (select (let ((.cse49 (store (store |c_#memory_$Pointer$.base| .cse50 (store .cse52 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4789))) (select .cse49 (select (select .cse49 (select (select .cse49 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse50 (store .cse51 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4788) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 0)) (not (= .cse53 .cse48)) (< v_prenex_878 0) (< .cse47 0) (= .cse48 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|) (< .cse54 0) (< (select (select .cse55 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_prenex_878) (not (= (select (select .cse56 .cse48) .cse54) .cse46)) (= .cse47 0)))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| 1)) (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| Int) (v_ArrVal_4788 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4789 (Array Int Int)) (v_ArrVal_4801 (Array Int Int))) (let ((.cse68 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4801))) (let ((.cse67 (select (select .cse68 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse61 (store (store |c_#memory_$Pointer$.base| .cse67 (store (select .cse68 .cse67) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4789)) (.cse63 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4800))) (let ((.cse66 (store (store |c_#memory_$Pointer$.offset| .cse67 (store (select .cse63 .cse67) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104| v_ArrVal_4788)) (.cse60 (select (select .cse61 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse64 (select .cse61 .cse60)) (.cse58 (select (select .cse66 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse65 (select .cse64 .cse58))) (let ((.cse59 (select (select .cse66 .cse65) 0)) (.cse62 (select (select .cse61 .cse65) 0))) (or (< .cse58 0) (< .cse59 0) (not (= .cse60 (select (select .cse61 .cse62) .cse59))) (< (select (select .cse63 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120|) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_120| 0) (= .cse60 (select .cse64 0)) (not (= .cse62 .cse65)) (= .cse62 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|) (not (= (select (select .cse66 .cse60) .cse58) 0))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_104|) 0))))) is different from true [2023-12-02 16:15:28,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090152733] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:15:28,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [769410772] [2023-12-02 16:15:28,398 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2023-12-02 16:15:28,398 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:15:28,399 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:15:28,399 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:15:28,399 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:15:29,968 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:15:29,987 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:16:02,105 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16095#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (not (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) 1)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 3) (<= 0 |ULTIMATE.start_main_#t~mem29#1.offset|) (or (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|))) (<= 0 |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:16:02,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:16:02,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:16:02,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31] total 62 [2023-12-02 16:16:02,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735853852] [2023-12-02 16:16:02,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:16:02,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-12-02 16:16:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:16:02,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-12-02 16:16:02,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=13835, Unknown=26, NotChecked=236, Total=14520 [2023-12-02 16:16:02,108 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 63 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 56 states have internal predecessors, (101), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:16:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:16:15,199 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2023-12-02 16:16:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-02 16:16:15,200 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 56 states have internal predecessors, (101), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2023-12-02 16:16:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:16:15,201 INFO L225 Difference]: With dead ends: 75 [2023-12-02 16:16:15,201 INFO L226 Difference]: Without dead ends: 75 [2023-12-02 16:16:15,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6103 ImplicationChecksByTransitivity, 57.1s TimeCoverageRelationStatistics Valid=777, Invalid=21251, Unknown=28, NotChecked=294, Total=22350 [2023-12-02 16:16:15,202 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 210 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:16:15,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 419 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-12-02 16:16:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-02 16:16:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2023-12-02 16:16:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 60 states have internal predecessors, (63), 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-12-02 16:16:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2023-12-02 16:16:15,204 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 59 [2023-12-02 16:16:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:16:15,204 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2023-12-02 16:16:15,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 56 states have internal predecessors, (101), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:16:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2023-12-02 16:16:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 16:16:15,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:16:15,205 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 16:16:15,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 16:16:15,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:16:15,406 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:16:15,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:16:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash -614101845, now seen corresponding path program 1 times [2023-12-02 16:16:15,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:16:15,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623880151] [2023-12-02 16:16:15,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:16:15,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:16:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:16:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:16:16,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:16:16,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623880151] [2023-12-02 16:16:16,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623880151] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:16:16,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535811000] [2023-12-02 16:16:16,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:16:16,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:16:16,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:16:16,041 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:16:16,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 16:16:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:16:16,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 16:16:16,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:16:16,948 INFO L349 Elim1Store]: treesize reduction 33, result has 59.3 percent of original size [2023-12-02 16:16:16,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 120 [2023-12-02 16:16:17,092 INFO L349 Elim1Store]: treesize reduction 29, result has 58.0 percent of original size [2023-12-02 16:16:17,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 86 [2023-12-02 16:16:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:16:17,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:16:17,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:16:17,969 INFO L378 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 67 treesize of output 71 [2023-12-02 16:16:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:16:18,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535811000] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:16:18,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1107406569] [2023-12-02 16:16:18,552 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2023-12-02 16:16:18,552 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:16:18,552 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:16:18,553 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:16:18,553 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:16:20,154 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:16:20,171 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:16:40,769 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16708#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 3) (<= 0 |ULTIMATE.start_main_#t~mem29#1.offset|) (or (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|))) (<= 0 |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (or (< (select |#length| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (+ |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 4)) (< |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:16:40,769 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:16:40,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:16:40,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 24 [2023-12-02 16:16:40,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653475164] [2023-12-02 16:16:40,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:16:40,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 16:16:40,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:16:40,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 16:16:40,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=4136, Unknown=15, NotChecked=0, Total=4422 [2023-12-02 16:16:40,771 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 25 states have internal predecessors, (79), 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-12-02 16:16:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:16:43,483 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2023-12-02 16:16:43,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 16:16:43,484 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 25 states have internal predecessors, (79), 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 59 [2023-12-02 16:16:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:16:43,485 INFO L225 Difference]: With dead ends: 74 [2023-12-02 16:16:43,485 INFO L226 Difference]: Without dead ends: 74 [2023-12-02 16:16:43,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=364, Invalid=5023, Unknown=15, NotChecked=0, Total=5402 [2023-12-02 16:16:43,486 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 120 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 16:16:43,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 360 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 16:16:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-02 16:16:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2023-12-02 16:16:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 60 states have internal predecessors, (62), 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-12-02 16:16:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2023-12-02 16:16:43,488 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 59 [2023-12-02 16:16:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:16:43,488 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2023-12-02 16:16:43,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 25 states have internal predecessors, (79), 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-12-02 16:16:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2023-12-02 16:16:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 16:16:43,489 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:16:43,489 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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] [2023-12-02 16:16:43,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-12-02 16:16:43,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-12-02 16:16:43,690 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:16:43,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:16:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1857285897, now seen corresponding path program 1 times [2023-12-02 16:16:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:16:43,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834361137] [2023-12-02 16:16:43,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:16:43,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:16:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:16:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:16:47,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:16:47,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834361137] [2023-12-02 16:16:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834361137] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:16:47,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158859736] [2023-12-02 16:16:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:16:47,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:16:47,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:16:47,938 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:16:47,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-12-02 16:16:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:16:48,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 135 conjunts are in the unsatisfiable core [2023-12-02 16:16:48,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:16:48,231 INFO L378 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-12-02 16:16:48,792 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:16:48,793 INFO L378 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-12-02 16:16:49,189 INFO L378 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-12-02 16:16:49,448 INFO L378 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 20 treesize of output 15 [2023-12-02 16:16:49,692 INFO L378 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 30 treesize of output 18 [2023-12-02 16:16:49,699 INFO L378 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-12-02 16:16:49,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:16:49,708 INFO L378 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 16:16:50,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:16:50,315 INFO L378 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 38 treesize of output 29 [2023-12-02 16:16:50,336 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:16:50,336 INFO L378 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-12-02 16:16:50,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:16:50,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:16:50,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-02 16:16:51,840 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:16:51,841 INFO L378 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 67 treesize of output 45 [2023-12-02 16:16:51,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:16:51,850 INFO L378 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 0 case distinctions, treesize of input 38 treesize of output 25 [2023-12-02 16:16:52,145 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 16:16:52,145 INFO L378 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 101 treesize of output 76 [2023-12-02 16:16:52,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:16:52,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:16:52,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2023-12-02 16:16:53,272 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:16:53,272 INFO L378 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 35 [2023-12-02 16:16:53,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:16:53,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:16:53,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:16:53,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2023-12-02 16:16:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:16:53,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:16:54,727 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5089 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (select .cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_5089))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 0) 0)) is different from false [2023-12-02 16:16:56,209 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5089 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (select .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_5089))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 0) 0)) is different from false [2023-12-02 16:16:56,233 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5089 (Array Int Int))) (= (select (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (let ((.cse5 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 (store .cse5 .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse5 .cse3))))))) (select .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_5089))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 0) 0)) is different from false [2023-12-02 16:16:56,256 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5089 (Array Int Int))) (= (select (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (let ((.cse5 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 (store .cse5 .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse5 .cse3))))))) (select .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_5089))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 0) 0)) is different from false [2023-12-02 16:16:56,509 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_111| Int) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5097 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (or (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_111| v_ArrVal_5096)) (.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_111| v_ArrVal_5097))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (let ((.cse7 (select .cse6 .cse2))) (let ((.cse5 (store .cse7 .cse4 0))) (store (store |c_#memory_$Pointer$.offset| .cse2 .cse5) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_111| (store (select (store .cse6 .cse2 .cse5) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_111|) 0 (select .cse7 .cse4))))))) (select .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select .cse3 .cse2) .cse4 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_111|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_111| v_ArrVal_5089))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) 0) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_111|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_111| 1)))) is different from false [2023-12-02 16:16:56,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158859736] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:16:56,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1520311817] [2023-12-02 16:16:56,514 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2023-12-02 16:16:56,514 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:16:56,515 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:16:56,515 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:16:56,515 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:16:58,067 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:16:58,094 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:17:25,971 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17256#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 3) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |ULTIMATE.start_sll_circular_destroy_~q~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~mem29#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|)) (or (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|))) (<= 0 |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |ULTIMATE.start_sll_circular_destroy_~q~0#1.offset|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)))' at error location [2023-12-02 16:17:25,971 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:17:25,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:17:25,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 29] total 56 [2023-12-02 16:17:25,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128469506] [2023-12-02 16:17:25,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:17:25,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-02 16:17:25,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:17:25,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-02 16:17:25,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=10480, Unknown=105, NotChecked=1050, Total=11990 [2023-12-02 16:17:25,973 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 57 states, 48 states have (on average 2.1875) internal successors, (105), 49 states have internal predecessors, (105), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 16:17:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:17:34,922 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2023-12-02 16:17:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 16:17:34,923 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 48 states have (on average 2.1875) internal successors, (105), 49 states have internal predecessors, (105), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 60 [2023-12-02 16:17:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:17:34,923 INFO L225 Difference]: With dead ends: 66 [2023-12-02 16:17:34,923 INFO L226 Difference]: Without dead ends: 66 [2023-12-02 16:17:34,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4388 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=590, Invalid=15309, Unknown=123, NotChecked=1270, Total=17292 [2023-12-02 16:17:34,925 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 169 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:17:34,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 472 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-02 16:17:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-02 16:17:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-12-02 16:17:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.125) internal successors, (63), 61 states have internal predecessors, (63), 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-12-02 16:17:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2023-12-02 16:17:34,927 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 60 [2023-12-02 16:17:34,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:17:34,927 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2023-12-02 16:17:34,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 48 states have (on average 2.1875) internal successors, (105), 49 states have internal predecessors, (105), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 16:17:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2023-12-02 16:17:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 16:17:34,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:17:34,928 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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] [2023-12-02 16:17:34,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-12-02 16:17:35,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:17:35,128 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:17:35,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:17:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1741287734, now seen corresponding path program 1 times [2023-12-02 16:17:35,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:17:35,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048447279] [2023-12-02 16:17:35,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:17:35,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:17:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:17:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:17:38,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:17:38,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048447279] [2023-12-02 16:17:38,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048447279] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:17:38,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944130838] [2023-12-02 16:17:38,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:17:38,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:17:38,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:17:38,715 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:17:38,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 16:17:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:17:39,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 122 conjunts are in the unsatisfiable core [2023-12-02 16:17:39,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:17:39,052 INFO L378 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-12-02 16:17:39,175 INFO L378 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-12-02 16:17:39,473 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:17:39,473 INFO L378 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-12-02 16:17:39,825 INFO L378 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-12-02 16:17:40,112 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-12-02 16:17:40,112 INFO L378 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 70 treesize of output 57 [2023-12-02 16:17:40,336 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 16:17:40,336 INFO L378 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 56 treesize of output 23 [2023-12-02 16:17:40,343 INFO L378 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-12-02 16:17:40,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:17:40,643 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 16:17:40,643 INFO L378 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 64 treesize of output 53 [2023-12-02 16:17:40,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:17:40,654 INFO L378 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 46 treesize of output 39 [2023-12-02 16:17:40,690 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:17:40,690 INFO L378 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-12-02 16:17:42,201 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2023-12-02 16:17:42,202 INFO L378 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 116 treesize of output 58 [2023-12-02 16:17:42,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:17:42,228 INFO L378 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-12-02 16:17:42,564 INFO L349 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2023-12-02 16:17:42,564 INFO L378 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 223 treesize of output 110 [2023-12-02 16:17:42,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:17:42,630 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2023-12-02 16:17:42,631 INFO L378 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 139 treesize of output 127 [2023-12-02 16:17:44,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:17:44,507 INFO L378 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 137 treesize of output 84 [2023-12-02 16:17:44,840 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-12-02 16:17:44,840 INFO L378 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 33 [2023-12-02 16:17:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:17:45,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:17:46,130 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5247 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_5247)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse0 (select (select .cse0 .cse1) .cse2)) 0) |c_#StackHeapBarrier|) (not (= (select (select .cse3 .cse1) .cse2) 0)))))) is different from false [2023-12-02 16:17:47,687 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5247 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse7 (store (select |c_#memory_$Pointer$.offset| .cse7) .cse6 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_5247)) (.cse0 (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse7 (store .cse5 .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse5 .cse6))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse0 (select (select .cse0 .cse1) .cse2)) 0) |c_#StackHeapBarrier|) (not (= (select (select .cse3 .cse1) .cse2) 0))))))) is different from false [2023-12-02 16:17:47,712 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5247 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse7 (store (select |c_#memory_$Pointer$.offset| .cse7) .cse6 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_5247)) (.cse0 (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse7 (store .cse5 .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse5 .cse6))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse0 (select (select .cse0 .cse1) .cse2)) 0) |c_#StackHeapBarrier|) (not (= (select (select .cse3 .cse1) .cse2) 0))))))) is different from false [2023-12-02 16:17:47,914 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5255 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_116| Int) (v_ArrVal_5256 (Array Int Int)) (v_ArrVal_5247 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_116| v_ArrVal_5255)) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_116| v_ArrVal_5256))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse8 (select (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select .cse9 .cse4) .cse8 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_116| v_ArrVal_5247)) (.cse0 (let ((.cse7 (select .cse6 .cse4))) (let ((.cse5 (store .cse7 .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_116|))) (store (store |c_#memory_$Pointer$.base| .cse4 .cse5) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_116| (store (select (store .cse6 .cse4 .cse5) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_116|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse7 .cse8))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_116| 1)) (< (select (select .cse0 (select (select .cse0 .cse1) .cse2)) 0) |c_#StackHeapBarrier|) (not (= (select (select .cse3 .cse1) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_116|) 0)))))))) is different from false [2023-12-02 16:17:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944130838] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:17:47,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [810005004] [2023-12-02 16:17:47,920 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2023-12-02 16:17:47,920 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:17:47,920 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:17:47,920 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:17:47,920 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:17:49,520 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2023-12-02 16:17:49,549 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:18:19,278 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17827#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 3) (<= 0 |ULTIMATE.start_main_#t~mem29#1.offset|) (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0) (<= |#StackHeapBarrier| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:18:19,278 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:18:19,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:18:19,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 50 [2023-12-02 16:18:19,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839587844] [2023-12-02 16:18:19,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:18:19,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 16:18:19,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:18:19,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 16:18:19,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=9453, Unknown=120, NotChecked=796, Total=10712 [2023-12-02 16:18:19,281 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 51 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 16:18:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:18:27,697 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2023-12-02 16:18:27,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 16:18:27,697 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 61 [2023-12-02 16:18:27,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:18:27,698 INFO L225 Difference]: With dead ends: 67 [2023-12-02 16:18:27,698 INFO L226 Difference]: Without dead ends: 67 [2023-12-02 16:18:27,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 121 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3843 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=533, Invalid=13390, Unknown=135, NotChecked=948, Total=15006 [2023-12-02 16:18:27,700 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 114 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-02 16:18:27,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 359 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-02 16:18:27,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-02 16:18:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-12-02 16:18:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 62 states have internal predecessors, (64), 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-12-02 16:18:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2023-12-02 16:18:27,703 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 61 [2023-12-02 16:18:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:18:27,703 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2023-12-02 16:18:27,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 16:18:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2023-12-02 16:18:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 16:18:27,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:18:27,704 INFO L195 NwaCegarLoop]: trace histogram [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-12-02 16:18:27,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 16:18:27,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-12-02 16:18:27,905 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:18:27,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:18:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1738952152, now seen corresponding path program 1 times [2023-12-02 16:18:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:18:27,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800567519] [2023-12-02 16:18:27,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:18:27,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:18:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:18:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:18:28,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:18:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800567519] [2023-12-02 16:18:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800567519] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:18:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057867442] [2023-12-02 16:18:28,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:18:28,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:18:28,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:18:28,725 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:18:28,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 16:18:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:18:29,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-02 16:18:29,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:18:29,977 INFO L349 Elim1Store]: treesize reduction 137, result has 29.0 percent of original size [2023-12-02 16:18:29,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 15 case distinctions, treesize of input 110 treesize of output 119 [2023-12-02 16:18:30,077 INFO L349 Elim1Store]: treesize reduction 94, result has 16.8 percent of original size [2023-12-02 16:18:30,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 79 [2023-12-02 16:18:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:18:30,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:18:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:18:32,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057867442] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:18:32,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [237385213] [2023-12-02 16:18:32,750 INFO L159 IcfgInterpreter]: Started Sifa with 49 locations of interest [2023-12-02 16:18:32,750 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:18:32,750 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:18:32,750 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:18:32,750 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:18:34,385 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:18:34,414 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:18:59,330 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18436#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 3) (<= 0 |ULTIMATE.start_main_#t~mem29#1.offset|) (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.base| 0)) (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (<= 0 |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) 1)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= (+ |ULTIMATE.start_sll_circular_destroy_~head#1.base| 1) |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:18:59,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:18:59,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:18:59,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 35 [2023-12-02 16:18:59,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594249887] [2023-12-02 16:18:59,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:18:59,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 16:18:59,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:18:59,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 16:18:59,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=5909, Unknown=14, NotChecked=0, Total=6320 [2023-12-02 16:18:59,332 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 35 states have internal predecessors, (85), 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-12-02 16:19:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:19:02,580 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2023-12-02 16:19:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 16:19:02,581 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 35 states have internal predecessors, (85), 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 61 [2023-12-02 16:19:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:19:02,581 INFO L225 Difference]: With dead ends: 68 [2023-12-02 16:19:02,581 INFO L226 Difference]: Without dead ends: 68 [2023-12-02 16:19:02,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=609, Invalid=7207, Unknown=16, NotChecked=0, Total=7832 [2023-12-02 16:19:02,582 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 176 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:19:02,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 427 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 16:19:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-02 16:19:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2023-12-02 16:19:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.105263157894737) internal successors, (63), 62 states have internal predecessors, (63), 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-12-02 16:19:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2023-12-02 16:19:02,584 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 61 [2023-12-02 16:19:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:19:02,585 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2023-12-02 16:19:02,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 35 states have internal predecessors, (85), 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-12-02 16:19:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2023-12-02 16:19:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 16:19:02,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:19:02,586 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 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] [2023-12-02 16:19:02,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 16:19:02,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-12-02 16:19:02,786 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:19:02,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:19:02,787 INFO L85 PathProgramCache]: Analyzing trace with hash -87657412, now seen corresponding path program 2 times [2023-12-02 16:19:02,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:19:02,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294148970] [2023-12-02 16:19:02,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:19:02,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:19:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:19:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:19:03,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:19:03,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294148970] [2023-12-02 16:19:03,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294148970] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:19:03,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146564509] [2023-12-02 16:19:03,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:19:03,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:19:03,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:19:03,637 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:19:03,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-12-02 16:19:04,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 16:19:04,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:19:04,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 182 conjunts are in the unsatisfiable core [2023-12-02 16:19:04,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:19:04,210 INFO L378 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-12-02 16:19:04,282 INFO L378 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-12-02 16:19:04,538 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 16:19:04,538 INFO L378 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 12 treesize of output 14 [2023-12-02 16:19:04,804 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:19:04,805 INFO L378 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 7 [2023-12-02 16:19:05,203 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-02 16:19:05,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2023-12-02 16:19:05,540 INFO L378 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-12-02 16:19:05,575 INFO L378 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-12-02 16:19:05,820 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 16:19:05,821 INFO L378 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 1 case distinctions, treesize of input 65 treesize of output 46 [2023-12-02 16:19:05,837 INFO L378 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 36 treesize of output 15 [2023-12-02 16:19:06,043 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:19:06,043 INFO L378 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 37 treesize of output 24 [2023-12-02 16:19:06,052 INFO L378 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-12-02 16:19:06,059 INFO L378 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 16:19:06,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:19:06,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:19:06,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:19:06,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-02 16:19:06,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:19:06,761 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 16:19:06,761 INFO L378 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 45 treesize of output 40 [2023-12-02 16:19:06,798 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:19:06,798 INFO L378 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-12-02 16:19:08,191 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 16:19:08,191 INFO L378 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 85 treesize of output 47 [2023-12-02 16:19:08,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:19:08,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-12-02 16:19:08,477 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-12-02 16:19:08,478 INFO L378 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 127 treesize of output 67 [2023-12-02 16:19:08,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:19:08,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:19:08,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:19:08,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2023-12-02 16:19:12,607 INFO L349 Elim1Store]: treesize reduction 166, result has 14.0 percent of original size [2023-12-02 16:19:12,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 139 treesize of output 88 [2023-12-02 16:19:12,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:19:12,675 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2023-12-02 16:19:12,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 24 [2023-12-02 16:19:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:19:13,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:19:20,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146564509] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:19:20,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1758006943] [2023-12-02 16:19:20,269 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2023-12-02 16:19:20,269 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:19:20,270 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:19:20,270 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:19:20,270 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:19:21,880 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:19:21,898 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:19:56,658 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '19015#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (not (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) 1)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 3) (<= 0 |ULTIMATE.start_main_#t~mem29#1.offset|) (or (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|))) (<= 0 |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:19:56,658 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:19:56,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:19:56,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 39] total 52 [2023-12-02 16:19:56,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919623867] [2023-12-02 16:19:56,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:19:56,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 16:19:56,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:19:56,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 16:19:56,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=12453, Unknown=23, NotChecked=0, Total=12882 [2023-12-02 16:19:56,660 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 52 states, 47 states have (on average 2.276595744680851) internal successors, (107), 47 states have internal predecessors, (107), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:20:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:20:08,718 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2023-12-02 16:20:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-02 16:20:08,718 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 2.276595744680851) internal successors, (107), 47 states have internal predecessors, (107), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 64 [2023-12-02 16:20:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:20:08,719 INFO L225 Difference]: With dead ends: 60 [2023-12-02 16:20:08,719 INFO L226 Difference]: Without dead ends: 60 [2023-12-02 16:20:08,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4986 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=822, Invalid=19459, Unknown=25, NotChecked=0, Total=20306 [2023-12-02 16:20:08,720 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 172 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:20:08,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 303 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-02 16:20:08,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-02 16:20:08,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-02 16:20:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 55 states have internal predecessors, (55), 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-12-02 16:20:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2023-12-02 16:20:08,723 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 64 [2023-12-02 16:20:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:20:08,723 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2023-12-02 16:20:08,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 2.276595744680851) internal successors, (107), 47 states have internal predecessors, (107), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:20:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2023-12-02 16:20:08,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-02 16:20:08,724 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:20:08,724 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 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] [2023-12-02 16:20:08,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-12-02 16:20:08,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-12-02 16:20:08,925 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-02 16:20:08,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:20:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1662975290, now seen corresponding path program 2 times [2023-12-02 16:20:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:20:08,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138428119] [2023-12-02 16:20:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:20:08,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:20:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:20:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:20:13,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:20:13,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138428119] [2023-12-02 16:20:13,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138428119] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:20:13,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911332291] [2023-12-02 16:20:13,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:20:13,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:20:13,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:20:13,771 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:20:13,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86dd0d63-e7e4-4fb6-a588-e91153f7bc04/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 16:20:14,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 16:20:14,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:20:14,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 16:20:14,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:20:15,016 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:20:15,016 INFO L378 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-12-02 16:20:15,725 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:20:15,726 INFO L378 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 19 treesize of output 18 [2023-12-02 16:20:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-02 16:20:15,770 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:20:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-02 16:20:17,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911332291] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:20:17,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1533627828] [2023-12-02 16:20:17,299 INFO L159 IcfgInterpreter]: Started Sifa with 49 locations of interest [2023-12-02 16:20:17,299 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:20:17,299 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:20:17,299 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:20:17,299 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:20:18,951 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 16:20:18,971 INFO L180 IcfgInterpreter]: Interpretation finished