./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 01:00:40,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 01:00:41,063 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 01:00:41,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 01:00:41,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 01:00:41,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 01:00:41,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 01:00:41,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 01:00:41,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 01:00:41,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 01:00:41,098 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 01:00:41,098 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 01:00:41,099 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 01:00:41,099 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 01:00:41,100 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 01:00:41,100 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 01:00:41,101 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 01:00:41,101 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 01:00:41,102 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 01:00:41,102 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 01:00:41,103 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 01:00:41,104 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 01:00:41,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 01:00:41,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 01:00:41,106 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 01:00:41,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 01:00:41,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 01:00:41,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 01:00:41,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 01:00:41,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 01:00:41,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 01:00:41,109 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 01:00:41,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 01:00:41,109 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 01:00:41,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 01:00:41,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 01:00:41,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:00:41,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 01:00:41,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 01:00:41,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 01:00:41,113 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 01:00:41,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 01:00:41,114 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 01:00:41,114 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 01:00:41,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 01:00:41,115 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/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_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2023-11-12 01:00:41,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 01:00:41,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 01:00:41,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 01:00:41,393 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 01:00:41,400 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 01:00:41,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-11-12 01:00:44,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 01:00:44,936 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 01:00:44,937 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-11-12 01:00:44,951 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/data/c9202c2bf/2ef5e3cec31a42b78c3834b083646d21/FLAGfd236ba45 [2023-11-12 01:00:44,970 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/data/c9202c2bf/2ef5e3cec31a42b78c3834b083646d21 [2023-11-12 01:00:44,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 01:00:44,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 01:00:44,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 01:00:44,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 01:00:44,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 01:00:44,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:00:44" (1/1) ... [2023-11-12 01:00:44,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32519cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:44, skipping insertion in model container [2023-11-12 01:00:44,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:00:44" (1/1) ... [2023-11-12 01:00:45,032 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 01:00:45,373 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_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2023-11-12 01:00:45,378 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:00:45,395 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 01:00:45,438 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_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2023-11-12 01:00:45,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:00:45,473 INFO L206 MainTranslator]: Completed translation [2023-11-12 01:00:45,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45 WrapperNode [2023-11-12 01:00:45,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 01:00:45,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 01:00:45,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 01:00:45,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 01:00:45,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45" (1/1) ... [2023-11-12 01:00:45,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45" (1/1) ... [2023-11-12 01:00:45,548 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2023-11-12 01:00:45,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 01:00:45,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 01:00:45,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 01:00:45,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 01:00:45,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45" (1/1) ... [2023-11-12 01:00:45,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45" (1/1) ... [2023-11-12 01:00:45,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45" (1/1) ... [2023-11-12 01:00:45,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45" (1/1) ... [2023-11-12 01:00:45,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45" (1/1) ... [2023-11-12 01:00:45,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45" (1/1) ... [2023-11-12 01:00:45,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45" (1/1) ... [2023-11-12 01:00:45,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45" (1/1) ... [2023-11-12 01:00:45,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 01:00:45,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 01:00:45,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 01:00:45,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 01:00:45,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45" (1/1) ... [2023-11-12 01:00:45,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:00:45,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:00:45,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 01:00:45,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 01:00:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-12 01:00:45,695 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-12 01:00:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 01:00:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 01:00:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 01:00:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 01:00:45,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 01:00:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 01:00:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 01:00:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 01:00:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 01:00:45,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 01:00:45,853 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 01:00:45,856 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 01:00:45,899 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-12 01:00:46,097 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 01:00:46,148 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 01:00:46,148 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 01:00:46,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:00:46 BoogieIcfgContainer [2023-11-12 01:00:46,151 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 01:00:46,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 01:00:46,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 01:00:46,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 01:00:46,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:00:44" (1/3) ... [2023-11-12 01:00:46,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba823fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:00:46, skipping insertion in model container [2023-11-12 01:00:46,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:00:45" (2/3) ... [2023-11-12 01:00:46,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba823fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:00:46, skipping insertion in model container [2023-11-12 01:00:46,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:00:46" (3/3) ... [2023-11-12 01:00:46,162 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2023-11-12 01:00:46,181 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 01:00:46,182 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 01:00:46,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 01:00:46,237 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=FINITE_AUTOMATA, 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;@3e7f1bb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 01:00:46,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 01:00:46,241 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-12 01:00:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 01:00:46,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:00:46,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:00:46,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 01:00:46,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:00:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1372459767, now seen corresponding path program 1 times [2023-11-12 01:00:46,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:00:46,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809957487] [2023-11-12 01:00:46,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:00:46,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:00:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:00:46,642 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-12 01:00:46,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:00:46,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809957487] [2023-11-12 01:00:46,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809957487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:00:46,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:00:46,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 01:00:46,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3150893] [2023-11-12 01:00:46,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:00:46,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 01:00:46,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:00:46,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 01:00:46,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 01:00:46,709 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-12 01:00:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:00:46,787 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2023-11-12 01:00:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 01:00:46,790 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-12 01:00:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:00:46,798 INFO L225 Difference]: With dead ends: 38 [2023-11-12 01:00:46,798 INFO L226 Difference]: Without dead ends: 18 [2023-11-12 01:00:46,802 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-12 01:00:46,808 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 01:00:46,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 41 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 01:00:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-12 01:00:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-11-12 01:00:46,846 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-12 01:00:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-12 01:00:46,850 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 7 [2023-11-12 01:00:46,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:00:46,851 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-12 01:00:46,851 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-12 01:00:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-11-12 01:00:46,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 01:00:46,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:00:46,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:00:46,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 01:00:46,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 01:00:46,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:00:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1451408273, now seen corresponding path program 1 times [2023-11-12 01:00:46,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:00:46,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838018449] [2023-11-12 01:00:46,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:00:46,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:00:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:00:47,078 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-12 01:00:47,079 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:00:47,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838018449] [2023-11-12 01:00:47,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838018449] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:00:47,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967151803] [2023-11-12 01:00:47,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:00:47,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:00:47,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:00:47,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:00:47,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 01:00:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:00:47,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 01:00:47,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:00:47,334 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-12 01:00:47,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:00:47,369 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-12 01:00:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967151803] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 01:00:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [570286630] [2023-11-12 01:00:47,403 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-12 01:00:47,403 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:00:47,413 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:00:47,419 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:00:47,421 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:00:49,137 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:00:49,664 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '156#(and (= |ULTIMATE.start_main_~data_new~0#1| 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_33| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_33| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_33| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)))) (= (store |v_#memory_int_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_int_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 (select (select |v_#memory_int_33| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4))) |v_#memory_int_33|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (exists ((|v_#memory_$Pointer$.base_36| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.base_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.base_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.base_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8))))) (= |ULTIMATE.start_main_~len~0#1| 5) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_36| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.offset_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 0)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.offset_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.offset_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 0)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 8 0)))) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|))' at error location [2023-11-12 01:00:49,665 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 01:00:49,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 01:00:49,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-12 01:00:49,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719955132] [2023-11-12 01:00:49,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 01:00:49,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:00:49,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:00:49,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:00:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-12 01:00:49,669 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-12 01:00:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:00:49,724 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-11-12 01:00:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:00:49,725 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-12 01:00:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:00:49,726 INFO L225 Difference]: With dead ends: 34 [2023-11-12 01:00:49,726 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 01:00:49,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-12 01:00:49,728 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 01:00:49,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 01:00:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 01:00:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-12 01:00:49,735 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-12 01:00:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-12 01:00:49,736 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 10 [2023-11-12 01:00:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:00:49,736 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-12 01:00:49,737 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-12 01:00:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-12 01:00:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 01:00:49,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:00:49,738 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:00:49,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 01:00:49,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:00:49,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 01:00:49,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:00:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2044865783, now seen corresponding path program 2 times [2023-11-12 01:00:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:00:49,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117356570] [2023-11-12 01:00:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:00:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:00:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:00:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 01:00:51,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:00:51,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117356570] [2023-11-12 01:00:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117356570] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:00:51,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111517976] [2023-11-12 01:00:51,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 01:00:51,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:00:51,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:00:51,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:00:51,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 01:00:52,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-12 01:00:52,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 01:00:52,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-12 01:00:52,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:00:52,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 01:00:52,509 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 01:00:52,509 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-12 01:00:52,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-12 01:00:52,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 01:00:52,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:00:52,654 INFO L322 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2023-11-12 01:00:52,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 11 [2023-11-12 01:00:52,669 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 01:00:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 01:00:52,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:00:52,813 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:00:52,814 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2023-11-12 01:00:52,828 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:00:52,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 214 [2023-11-12 01:00:52,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 146 [2023-11-12 01:00:52,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-12 01:00:53,221 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-12 01:00:53,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111517976] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 01:00:53,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [770327812] [2023-11-12 01:00:53,225 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-12 01:00:53,225 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:00:53,226 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:00:53,226 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:00:53,226 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:00:54,089 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:00:54,921 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '371#(and (= |ULTIMATE.start_main_~data_new~0#1| 1) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (exists ((|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.offset_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 0)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.offset_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.offset_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 0)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 8 0)))) (= |ULTIMATE.start_main_~len~0#1| 5) (exists ((|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_int_33| (Array Int (Array Int Int)))) (and (= |v_#memory_int_33| (store |v_#memory_int_85| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_int_85| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 (select (select |v_#memory_int_33| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4)))) (= |#memory_int| (store |v_#memory_int_33| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_33| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)))))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|) (exists ((|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8))) |#memory_$Pointer$.base|)))' at error location [2023-11-12 01:00:54,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 01:00:54,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 01:00:54,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2023-11-12 01:00:54,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776070208] [2023-11-12 01:00:54,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 01:00:54,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-12 01:00:54,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:00:54,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-12 01:00:54,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2023-11-12 01:00:54,925 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 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-12 01:00:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:00:55,728 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-11-12 01:00:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 01:00:55,729 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 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-12 01:00:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:00:55,730 INFO L225 Difference]: With dead ends: 29 [2023-11-12 01:00:55,730 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 01:00:55,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=173, Invalid=1233, Unknown=0, NotChecked=0, Total=1406 [2023-11-12 01:00:55,733 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 01:00:55,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 01:00:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 01:00:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-12 01:00:55,739 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-12 01:00:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-12 01:00:55,746 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2023-11-12 01:00:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:00:55,747 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-12 01:00:55,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 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-12 01:00:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-12 01:00:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-12 01:00:55,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:00:55,753 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:00:55,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 01:00:55,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:00:55,961 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 01:00:55,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:00:55,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1220729213, now seen corresponding path program 1 times [2023-11-12 01:00:55,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:00:55,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456827231] [2023-11-12 01:00:55,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:00:55,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:00:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:00:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 01:00:58,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:00:58,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456827231] [2023-11-12 01:00:58,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456827231] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:00:58,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886489060] [2023-11-12 01:00:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:00:58,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:00:58,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:00:58,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:00:58,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba6979c3-4bb6-4b9e-8cc2-4cbcc7c126be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 01:00:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:00:58,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-12 01:00:58,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:00:58,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 01:00:58,301 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 01:00:58,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 01:00:58,353 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 01:00:58,354 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 01:00:58,532 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-12 01:00:58,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-12 01:00:58,696 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-12 01:00:58,702 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 01:00:58,838 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-12 01:00:58,838 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-11-12 01:00:58,973 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 01:00:58,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:00:58,982 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-12 01:00:58,987 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-12 01:00:58,995 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-12 01:00:59,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-12 01:00:59,023 INFO L351 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-12 01:00:59,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2023-11-12 01:00:59,039 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-12 01:00:59,140 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2023-11-12 01:00:59,154 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2023-11-12 01:00:59,176 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2023-11-12 01:00:59,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:00:59,186 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2023-11-12 01:00:59,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-12 01:00:59,197 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-11-12 01:00:59,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:00:59,334 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2023-11-12 01:00:59,343 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2023-11-12 01:00:59,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 01:00:59,361 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:00:59,362 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2023-11-12 01:00:59,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2023-11-12 01:00:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 01:00:59,451 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:00:59,462 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_563) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0))) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2023-11-12 01:00:59,501 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_563) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2023-11-12 01:00:59,526 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:00:59,527 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 97 [2023-11-12 01:00:59,537 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 288 [2023-11-12 01:00:59,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 266 [2023-11-12 01:00:59,591 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:00:59,598 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6118 treesize of output 6092 [2023-11-12 01:00:59,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 446 treesize of output 430 [2023-11-12 01:00:59,740 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 206 [2023-11-12 01:01:02,705 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse16 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse15 (not .cse16)) (.cse10 (not .cse5)) (.cse18 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse24 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse66 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse67 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select .cse66 v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse67 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse66 v_arrayElimCell_42) v_arrayElimCell_45))))))) (.cse19 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse64 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse65 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (= (select (select .cse64 v_arrayElimCell_42) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select .cse64 v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse65 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (.cse41 (not .cse18)) (.cse22 (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse11 (or .cse10 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse63 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_42) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (not (= v_ArrVal_550 (store (select .cse63 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (.cse23 (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse61 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse62 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse60 (select .cse61 v_arrayElimCell_42))) (or (= (select .cse60 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select .cse61 v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse62 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse60 v_arrayElimCell_45))))))) .cse15)) (.cse27 (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse58 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse59 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse57 (select .cse58 v_arrayElimCell_42))) (or (= (select .cse57 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse58 v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse58 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse57 v_arrayElimCell_45)))))) (not (= v_ArrVal_550 (store (select .cse59 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))))) (and (or (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_ArrVal_561 Int) (v_ArrVal_563 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (forall ((v_arrayElimCell_42 Int)) (let ((.cse0 (select .cse1 v_arrayElimCell_42))) (or (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (= (select (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_550 (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (or .cse5 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 v_arrayElimCell_42) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (= (select (select .cse8 v_arrayElimCell_42) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))))))) .cse10) (or (and .cse11 (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_ArrVal_561 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_42))) (or (= (select .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= v_ArrVal_550 (store (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_42) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_550 (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))) .cse5)) .cse15) (or .cse16 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) .cse18) (or (and (or .cse19 .cse15) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (= (select (select .cse20 v_arrayElimCell_42) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse20 v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_550 (store (select .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))))))))) .cse10) (or .cse22 (and .cse23 (or (and (or .cse24 .cse15) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (= (select (select .cse25 v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse25 v_arrayElimCell_42) v_arrayElimCell_45))))) (not (= v_ArrVal_550 (store (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))))))))) .cse5) .cse27)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse28 (select .cse29 v_arrayElimCell_42))) (or (= (select .cse28 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse29 v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse28 v_arrayElimCell_45))))))) .cse15) (or (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse31 (select .cse32 v_arrayElimCell_42))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse32 v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse32 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 v_arrayElimCell_45)))))) (not (= v_ArrVal_550 (store (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse34 (select .cse35 v_arrayElimCell_42))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse35 v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse34 v_arrayElimCell_45))))))) .cse15)) .cse5) (or (and (or .cse16 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_45 Int)) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))))))) (or .cse24 .cse5) (or .cse19 .cse10) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= v_ArrVal_550 (store (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (forall ((v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_45 Int)) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (= (select (select .cse39 v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_42 Int)) (let ((.cse40 (select .cse39 v_arrayElimCell_42))) (or (= (select .cse40 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse40 v_arrayElimCell_45)))))))))))))) .cse41) (or (let ((.cse42 (and (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (not (= v_ArrVal_550 (store (select .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_42) v_arrayElimCell_45))))) .cse5) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_ArrVal_561 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_42))) (or (= (select .cse50 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 v_arrayElimCell_45))))) (not (= v_ArrVal_550 (store (select .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))))))))))) (and (or .cse42 .cse41) (or .cse42 .cse22) (or .cse10 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse43 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_42))) (or (= (select .cse43 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (not (= v_ArrVal_550 (store (select .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse43 v_arrayElimCell_45))))))) .cse11 (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse45 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse46 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_42))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_550 (store (select .cse46 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse45 v_arrayElimCell_45)))))) .cse5) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= v_ArrVal_550 (store (select .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (forall ((v_ArrVal_561 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse48 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_42))) (or (= (select .cse48 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse48 v_arrayElimCell_45)))))))))))) .cse15) (or .cse16 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_45 Int)) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select .cse52 v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse52 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_ArrVal_561 Int) (v_arrayElimCell_46 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (let ((.cse55 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse54 (select .cse55 v_arrayElimCell_42))) (or (= (select .cse54 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse55 v_arrayElimCell_46) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse54 v_arrayElimCell_45)))))) (not (= v_ArrVal_550 (store (select .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (or (and .cse23 .cse27) .cse10))))) is different from false [2023-11-12 01:01:05,648 INFO L322 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-12 01:01:05,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-12 01:01:05,701 INFO L322 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-12 01:01:05,702 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-12 01:01:05,774 INFO L322 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-12 01:01:05,774 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-12 01:01:05,841 INFO L322 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-12 01:01:05,841 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-12 01:01:15,951 INFO L322 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2023-11-12 01:01:15,952 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 995 treesize of output 976 [2023-11-12 01:01:15,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2023-11-12 01:01:15,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:01:15,992 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:15,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 62 [2023-11-12 01:01:16,016 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:16,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 93 [2023-11-12 01:01:16,038 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 01:01:16,115 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:16,115 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2023-11-12 01:01:16,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-11-12 01:01:16,158 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-12 01:01:16,215 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 79 [2023-11-12 01:01:16,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 01:01:16,321 INFO L322 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-12 01:01:16,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 995 treesize of output 981 [2023-11-12 01:01:16,342 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2023-11-12 01:01:16,353 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:01:16,369 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:16,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2023-11-12 01:01:16,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 01:01:16,427 INFO L322 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-11-12 01:01:16,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 100 [2023-11-12 01:01:16,469 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 01:01:16,633 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:16,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 79 [2023-11-12 01:01:17,073 INFO L322 Elim1Store]: treesize reduction 60, result has 35.5 percent of original size [2023-11-12 01:01:17,073 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 117 treesize of output 138 [2023-11-12 01:01:17,222 INFO L322 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2023-11-12 01:01:17,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 24 [2023-11-12 01:01:17,266 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:17,267 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 17 [2023-11-12 01:01:17,357 INFO L322 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2023-11-12 01:01:17,358 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 24 [2023-11-12 01:01:17,441 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:17,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2023-11-12 01:01:17,517 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:01:17,518 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-11-12 01:01:17,624 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:17,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 240 treesize of output 234 [2023-11-12 01:01:17,844 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:01:17,845 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:01:17,992 INFO L322 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2023-11-12 01:01:17,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 14923 treesize of output 14782 [2023-11-12 01:01:18,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 966 [2023-11-12 01:01:18,317 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:01:18,367 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:18,367 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1514 treesize of output 1494 [2023-11-12 01:01:18,510 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1575 treesize of output 1521 [2023-11-12 01:01:21,712 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 01:01:21,978 INFO L322 Elim1Store]: treesize reduction 63, result has 51.5 percent of original size [2023-11-12 01:01:21,980 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 90831 treesize of output 89793 [2023-11-12 01:01:22,838 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:22,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 17588 treesize of output 17308 [2023-11-12 01:01:23,997 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:23,998 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 15208 treesize of output 14936 [2023-11-12 01:01:25,072 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:25,073 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20377 treesize of output 19919 [2023-11-12 01:01:26,721 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:26,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 15984 treesize of output 15928 [2023-11-12 01:01:28,551 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 01:01:28,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 01:01:28,807 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 01:01:30,532 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:30,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 166 [2023-11-12 01:01:31,942 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:31,943 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 88 [2023-11-12 01:01:32,538 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-12 01:01:32,539 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 1 [2023-11-12 01:01:32,692 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:32,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 88 [2023-11-12 01:01:33,467 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:01:33,467 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 88