./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 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_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:09:26,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:09:26,896 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 22:09:26,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:09:26,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:09:26,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:09:26,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:09:26,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:09:26,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:09:26,947 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:09:26,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:09:26,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:09:26,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:09:26,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:09:26,951 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:09:26,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:09:26,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:09:26,953 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:09:26,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:09:26,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:09:26,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:09:26,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:09:26,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:09:26,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:09:26,955 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:09:26,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:09:26,956 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:09:26,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:09:26,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:09:26,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:09:26,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:09:26,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:09:26,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:09:26,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:09:26,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:09:26,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:09:26,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:09:26,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:09:26,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:09:26,961 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:09:26,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:09:26,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:09:26,961 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/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_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2023-11-21 22:09:27,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:09:27,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:09:27,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:09:27,283 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:09:27,283 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:09:27,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-21 22:09:30,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:09:30,758 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:09:30,759 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-21 22:09:30,780 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/data/403f45323/9ceca24355a942c38d1ad55255383e23/FLAGa1f06a884 [2023-11-21 22:09:30,797 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/data/403f45323/9ceca24355a942c38d1ad55255383e23 [2023-11-21 22:09:30,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:09:30,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:09:30,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:09:30,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:09:30,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:09:30,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:09:30" (1/1) ... [2023-11-21 22:09:30,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6997f3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:30, skipping insertion in model container [2023-11-21 22:09:30,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:09:30" (1/1) ... [2023-11-21 22:09:30,860 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:09:31,219 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-11-21 22:09:31,226 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:09:31,243 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:09:31,325 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-11-21 22:09:31,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:09:31,370 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:09:31,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31 WrapperNode [2023-11-21 22:09:31,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:09:31,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:09:31,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:09:31,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:09:31,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (1/1) ... [2023-11-21 22:09:31,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (1/1) ... [2023-11-21 22:09:31,448 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2023-11-21 22:09:31,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:09:31,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:09:31,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:09:31,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:09:31,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (1/1) ... [2023-11-21 22:09:31,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (1/1) ... [2023-11-21 22:09:31,468 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (1/1) ... [2023-11-21 22:09:31,482 INFO L187 HeapSplitter]: Split 12 memory accesses to 2 slices as follows [2, 10] [2023-11-21 22:09:31,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (1/1) ... [2023-11-21 22:09:31,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (1/1) ... [2023-11-21 22:09:31,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (1/1) ... [2023-11-21 22:09:31,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (1/1) ... [2023-11-21 22:09:31,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (1/1) ... [2023-11-21 22:09:31,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (1/1) ... [2023-11-21 22:09:31,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:09:31,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:09:31,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:09:31,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:09:31,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (1/1) ... [2023-11-21 22:09:31,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:09:31,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:09:31,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:09:31,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:09:31,586 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-21 22:09:31,586 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-21 22:09:31,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 22:09:31,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 22:09:31,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:09:31,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 22:09:31,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:09:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:09:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-21 22:09:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-21 22:09:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 22:09:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 22:09:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:09:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:09:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:09:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:09:31,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:09:31,717 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:09:31,720 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:09:31,761 INFO L774 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-21 22:09:32,055 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:09:32,147 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:09:32,148 INFO L308 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-21 22:09:32,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:09:32 BoogieIcfgContainer [2023-11-21 22:09:32,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:09:32,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:09:32,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:09:32,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:09:32,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:09:30" (1/3) ... [2023-11-21 22:09:32,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f05da46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:09:32, skipping insertion in model container [2023-11-21 22:09:32,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:09:31" (2/3) ... [2023-11-21 22:09:32,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f05da46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:09:32, skipping insertion in model container [2023-11-21 22:09:32,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:09:32" (3/3) ... [2023-11-21 22:09:32,188 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-11-21 22:09:32,210 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:09:32,210 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-21 22:09:32,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:09:32,290 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@69b5297c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:09:32,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 22:09:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-21 22:09:32,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:09:32,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:09:32,304 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:09:32,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:09:32,310 INFO L85 PathProgramCache]: Analyzing trace with hash 545307248, now seen corresponding path program 1 times [2023-11-21 22:09:32,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:09:32,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589064074] [2023-11-21 22:09:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:32,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:09:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:09:32,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:09:32,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589064074] [2023-11-21 22:09:32,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589064074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:09:32,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:09:32,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:09:32,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597939277] [2023-11-21 22:09:32,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:09:32,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:09:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:09:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:09:32,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:09:32,829 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:32,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:09:32,871 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2023-11-21 22:09:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:09:32,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-21 22:09:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:09:32,880 INFO L225 Difference]: With dead ends: 38 [2023-11-21 22:09:32,881 INFO L226 Difference]: Without dead ends: 18 [2023-11-21 22:09:32,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:09:32,888 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:09:32,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:09:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-21 22:09:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-11-21 22:09:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-21 22:09:32,926 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 7 [2023-11-21 22:09:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:09:32,926 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-21 22:09:32,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-11-21 22:09:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 22:09:32,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:09:32,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:09:32,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:09:32,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:09:32,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:09:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash 76022282, now seen corresponding path program 1 times [2023-11-21 22:09:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:09:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377982323] [2023-11-21 22:09:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:32,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:09:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:09:33,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:09:33,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377982323] [2023-11-21 22:09:33,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377982323] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:09:33,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180851716] [2023-11-21 22:09:33,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:33,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:09:33,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:09:33,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:09:33,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:09:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:33,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 22:09:33,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:09:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:09:33,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:09:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:09:33,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180851716] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:09:33,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:09:33,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-21 22:09:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807417499] [2023-11-21 22:09:33,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:09:33,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:09:33,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:09:33,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:09:33,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:09:33,414 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:09:33,452 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-11-21 22:09:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:09:33,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-21 22:09:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:09:33,454 INFO L225 Difference]: With dead ends: 34 [2023-11-21 22:09:33,454 INFO L226 Difference]: Without dead ends: 25 [2023-11-21 22:09:33,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:09:33,456 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:09:33,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:09:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-21 22:09:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-21 22:09:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-21 22:09:33,463 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 10 [2023-11-21 22:09:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:09:33,464 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-21 22:09:33,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-21 22:09:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-21 22:09:33,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:09:33,466 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:09:33,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-21 22:09:33,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:09:33,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:09:33,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:09:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash 633974256, now seen corresponding path program 2 times [2023-11-21 22:09:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:09:33,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196462240] [2023-11-21 22:09:33,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:33,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:09:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:09:34,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:09:34,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196462240] [2023-11-21 22:09:34,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196462240] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:09:34,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264511509] [2023-11-21 22:09:34,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:09:34,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:09:34,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:09:34,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:09:35,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:09:35,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:09:35,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:09:35,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-21 22:09:35,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:09:35,437 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-11-21 22:09:35,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:09:35,506 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 23 treesize of output 11 [2023-11-21 22:09:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-21 22:09:35,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:09:35,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:35,708 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2023-11-21 22:09:35,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:35,721 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 47 treesize of output 49 [2023-11-21 22:09:35,772 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 41 treesize of output 29 [2023-11-21 22:09:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-21 22:09:35,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264511509] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:09:35,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:09:35,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2023-11-21 22:09:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616650977] [2023-11-21 22:09:35,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:09:35,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-21 22:09:35,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:09:35,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-21 22:09:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2023-11-21 22:09:35,927 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:09:36,289 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-11-21 22:09:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:09:36,289 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-21 22:09:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:09:36,291 INFO L225 Difference]: With dead ends: 29 [2023-11-21 22:09:36,291 INFO L226 Difference]: Without dead ends: 27 [2023-11-21 22:09:36,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2023-11-21 22:09:36,293 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:09:36,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:09:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-21 22:09:36,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-21 22:09:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-21 22:09:36,303 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2023-11-21 22:09:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:09:36,303 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-21 22:09:36,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-21 22:09:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-21 22:09:36,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:09:36,305 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:09:36,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-21 22:09:36,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:09:36,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:09:36,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:09:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1756795556, now seen corresponding path program 1 times [2023-11-21 22:09:36,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:09:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18357845] [2023-11-21 22:09:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:36,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:09:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:09:38,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:09:38,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18357845] [2023-11-21 22:09:38,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18357845] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:09:38,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654738156] [2023-11-21 22:09:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:38,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:09:38,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:09:38,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:09:38,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 22:09:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:38,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-21 22:09:38,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:09:38,424 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-11-21 22:09:38,526 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 18 treesize of output 7 [2023-11-21 22:09:38,549 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 22:09:38,549 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-11-21 22:09:38,567 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 22 treesize of output 1 [2023-11-21 22:09:38,660 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-21 22:09:38,661 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 31 treesize of output 30 [2023-11-21 22:09:38,679 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-21 22:09:38,679 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 19 treesize of output 18 [2023-11-21 22:09:38,691 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 15 [2023-11-21 22:09:38,954 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:09:38,954 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 1 case distinctions, treesize of input 50 treesize of output 37 [2023-11-21 22:09:38,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:38,973 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 42 treesize of output 34 [2023-11-21 22:09:38,995 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:09:38,996 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 31 treesize of output 30 [2023-11-21 22:09:39,009 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:09:39,010 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 1 case distinctions, treesize of input 43 treesize of output 34 [2023-11-21 22:09:39,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:39,028 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 28 treesize of output 28 [2023-11-21 22:09:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:09:39,163 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:09:39,356 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_368 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_368) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_372) .cse0) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_368 (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_368 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))))))) (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_368 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_368) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_372) (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_368 (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_368 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) is different from false [2023-11-21 22:09:39,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:39,461 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 482 treesize of output 498 [2023-11-21 22:09:39,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:39,531 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 681 treesize of output 693 [2023-11-21 22:09:39,671 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 22:09:39,944 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 22:09:40,196 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse3 (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse4 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_2) (forall ((v_prenex_3 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (or (forall ((v_prenex_1 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1 .cse0)) (= (select (select (store (store |c_#memory_int#1| v_prenex_2 v_prenex_3) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_3)))))))) (or (and (forall ((v_prenex_1 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)))) (forall ((v_prenex_1 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1 .cse0))))) .cse2) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_3)) (= (select (select (store (store |c_#memory_int#1| v_prenex_2 v_prenex_3) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (or (forall ((v_prenex_1 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1 .cse0)) (= (select (select (store (store |c_#memory_int#1| v_prenex_2 v_prenex_3) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_3)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse2) (or (and (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_372 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)))) .cse3) .cse4 .cse2) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_372 (Array Int Int)) (v_ArrVal_363 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_368) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_368 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_368 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) (or (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_363 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_368 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_368) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_368 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_368 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) .cse2) (forall ((v_ArrVal_372 (Array Int Int))) (or (= (select v_ArrVal_372 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_363 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_368 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_368) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_368 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_368 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) (or (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_363 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_368 (Array Int Int))) (or (= (select v_ArrVal_372 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_368) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_368 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_368 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) .cse2) (or .cse3 .cse2)) .cse4) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_3)) (= (select (select (store (store |c_#memory_int#1| v_prenex_2 v_prenex_3) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) is different from false [2023-11-21 22:09:40,752 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) (and (or (and .cse0 (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_372 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))))) .cse2 .cse3) (or .cse2 (and (forall ((v_prenex_1 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)))) (forall ((v_prenex_1 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)) (= (select v_prenex_1 4) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_3)) (= (select (select (store (store |c_#memory_int#1| v_prenex_2 v_prenex_3) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (or (forall ((v_prenex_1 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| v_prenex_2 v_prenex_3) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_1 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_3)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse2) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_372 (Array Int Int)) (v_ArrVal_363 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_368) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_368 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_368 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) (forall ((v_ArrVal_372 (Array Int Int))) (or (= (select v_ArrVal_372 4) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_363 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_368 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_368) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_368 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_368 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) (or (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_363 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_368 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_368) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_368 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_368 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) .cse2) (or .cse0 .cse2) (or .cse2 (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_363 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_368 (Array Int Int))) (or (= (select v_ArrVal_372 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_368) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_368 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_368 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) .cse3) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_2 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_2) (forall ((v_prenex_3 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (or (forall ((v_prenex_1 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| v_prenex_2 v_prenex_3) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_1 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_3)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_3)) (= (select (select (store (store |c_#memory_int#1| v_prenex_2 v_prenex_3) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) is different from false [2023-11-21 22:09:40,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:40,923 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2023-11-21 22:09:40,927 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:09:40,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:40,934 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 1 case distinctions, treesize of input 66 treesize of output 68 [2023-11-21 22:09:40,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:40,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2023-11-21 22:09:40,972 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 8 treesize of output 6 [2023-11-21 22:09:41,000 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 41 treesize of output 29 [2023-11-21 22:09:41,008 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-11-21 22:09:41,018 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-21 22:09:41,018 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2023-11-21 22:09:41,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:41,029 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2023-11-21 22:09:41,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:09:41,036 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:09:41,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:41,045 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 1 case distinctions, treesize of input 47 treesize of output 49 [2023-11-21 22:09:41,081 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 41 treesize of output 29 [2023-11-21 22:09:41,090 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-11-21 22:09:41,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:41,102 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-21 22:09:41,107 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 36 treesize of output 24 [2023-11-21 22:09:41,112 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-11-21 22:09:41,123 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-21 22:09:41,124 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2023-11-21 22:09:41,132 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 22:09:41,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:09:41,141 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2023-11-21 22:09:41,145 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:09:41,155 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-21 22:09:41,156 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 1 case distinctions, treesize of input 81 treesize of output 78 [2023-11-21 22:09:41,164 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 21 treesize of output 13 [2023-11-21 22:09:41,172 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:09:41,172 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 13 treesize of output 7 [2023-11-21 22:09:41,189 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:09:41,190 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2023-11-21 22:09:41,198 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:09:41,198 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2023-11-21 22:09:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 13 not checked. [2023-11-21 22:09:41,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654738156] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:09:41,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:09:41,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2023-11-21 22:09:41,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381386100] [2023-11-21 22:09:41,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:09:41,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-21 22:09:41,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:09:41,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-21 22:09:41,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=575, Unknown=3, NotChecked=150, Total=812 [2023-11-21 22:09:41,303 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:09:42,556 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-11-21 22:09:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 22:09:42,556 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-21 22:09:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:09:42,558 INFO L225 Difference]: With dead ends: 41 [2023-11-21 22:09:42,558 INFO L226 Difference]: Without dead ends: 39 [2023-11-21 22:09:42,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=219, Invalid=1122, Unknown=3, NotChecked=216, Total=1560 [2023-11-21 22:09:42,560 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:09:42,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2023-11-21 22:09:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-21 22:09:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2023-11-21 22:09:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-21 22:09:42,573 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2023-11-21 22:09:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:09:42,573 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-21 22:09:42,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-21 22:09:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-21 22:09:42,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:09:42,576 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:09:42,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:09:42,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:09:42,797 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:09:42,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:09:42,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1375297979, now seen corresponding path program 1 times [2023-11-21 22:09:42,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:09:42,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704015469] [2023-11-21 22:09:42,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:42,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:09:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:09:43,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:09:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704015469] [2023-11-21 22:09:43,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704015469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:09:43,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939113203] [2023-11-21 22:09:43,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:43,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:09:43,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:09:43,423 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:09:43,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 22:09:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:43,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-21 22:09:43,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:09:43,601 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-11-21 22:09:43,626 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 22:09:43,627 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-11-21 22:09:43,643 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-21 22:09:43,644 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-11-21 22:09:43,676 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 22:09:43,677 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-11-21 22:09:43,746 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-21 22:09:43,746 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 16 treesize of output 18 [2023-11-21 22:09:43,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-11-21 22:09:43,824 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 25 treesize of output 18 [2023-11-21 22:09:43,855 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 16 treesize of output 8 [2023-11-21 22:09:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:09:43,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:09:43,870 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_525 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2023-11-21 22:09:43,877 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 41 treesize of output 39 [2023-11-21 22:09:43,881 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 22 treesize of output 20 [2023-11-21 22:09:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 4 not checked. [2023-11-21 22:09:44,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939113203] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:09:44,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:09:44,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-11-21 22:09:44,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676640642] [2023-11-21 22:09:44,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:09:44,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-21 22:09:44,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:09:44,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-21 22:09:44,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=285, Unknown=1, NotChecked=34, Total=380 [2023-11-21 22:09:44,132 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:09:44,421 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2023-11-21 22:09:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:09:44,422 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-21 22:09:44,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:09:44,423 INFO L225 Difference]: With dead ends: 36 [2023-11-21 22:09:44,423 INFO L226 Difference]: Without dead ends: 30 [2023-11-21 22:09:44,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=428, Unknown=1, NotChecked=44, Total=600 [2023-11-21 22:09:44,424 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:09:44,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 80 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2023-11-21 22:09:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-21 22:09:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-21 22:09:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-11-21 22:09:44,436 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2023-11-21 22:09:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:09:44,437 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-11-21 22:09:44,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-11-21 22:09:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-21 22:09:44,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:09:44,440 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-21 22:09:44,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:09:44,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:09:44,660 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:09:44,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:09:44,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1774124688, now seen corresponding path program 2 times [2023-11-21 22:09:44,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:09:44,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577421093] [2023-11-21 22:09:44,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:44,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:09:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:09:46,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:09:46,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577421093] [2023-11-21 22:09:46,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577421093] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:09:46,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666152277] [2023-11-21 22:09:46,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:09:46,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:09:46,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:09:46,888 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:09:46,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79a9420b-1b03-42d6-84e7-ec19017a6d19/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 22:09:47,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:09:47,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:09:47,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 103 conjunts are in the unsatisfiable core [2023-11-21 22:09:47,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:09:47,082 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-11-21 22:09:47,158 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-21 22:09:47,159 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-11-21 22:09:47,233 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 22:09:47,233 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-11-21 22:09:47,308 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-11-21 22:09:47,390 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-21 22:09:47,391 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 16 treesize of output 18 [2023-11-21 22:09:47,485 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 20 treesize of output 15 [2023-11-21 22:09:47,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-21 22:09:47,500 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 18 treesize of output 7 [2023-11-21 22:09:47,681 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-21 22:09:47,681 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 1 case distinctions, treesize of input 30 treesize of output 22 [2023-11-21 22:09:47,718 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-21 22:09:47,718 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 1 case distinctions, treesize of input 66 treesize of output 39 [2023-11-21 22:09:47,737 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:09:47,737 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-21 22:09:47,977 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-21 22:09:47,978 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 3 case distinctions, treesize of input 127 treesize of output 88 [2023-11-21 22:09:48,020 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2023-11-21 22:09:48,020 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 3 case distinctions, treesize of input 73 treesize of output 75 [2023-11-21 22:09:48,045 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-21 22:09:48,045 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 26 treesize of output 28 [2023-11-21 22:09:48,835 INFO L349 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2023-11-21 22:09:48,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 229 treesize of output 167 [2023-11-21 22:09:48,943 INFO L349 Elim1Store]: treesize reduction 60, result has 62.5 percent of original size [2023-11-21 22:09:48,944 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 295 [2023-11-21 22:09:48,970 INFO L349 Elim1Store]: treesize reduction 140, result has 0.7 percent of original size [2023-11-21 22:09:48,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 218 treesize of output 221