./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:39:17,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:39:17,248 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:39:17,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:39:17,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:39:17,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:39:17,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:39:17,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:39:17,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:39:17,314 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:39:17,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:39:17,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:39:17,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:39:17,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:39:17,316 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:39:17,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:39:17,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:39:17,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:39:17,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:39:17,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:39:17,317 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:39:17,318 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:39:17,318 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:39:17,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:39:17,318 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:39:17,318 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:39:17,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:39:17,319 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:39:17,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:39:17,319 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:39:17,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:39:17,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:39:17,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:39:17,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:39:17,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:39:17,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:39:17,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:39:17,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:39:17,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:39:17,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:39:17,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:39:17,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:39:17,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:39:17,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:39:17,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:39:17,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:39:17,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:39:17,323 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2024-11-28 03:39:17,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:39:17,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:39:17,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:39:17,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:39:17,742 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:39:17,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-28 03:39:21,450 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/data/78e06bf43/45ef41ed2161456b9f113f2c1a770525/FLAGc9555e11c [2024-11-28 03:39:21,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:39:21,907 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-28 03:39:21,932 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/data/78e06bf43/45ef41ed2161456b9f113f2c1a770525/FLAGc9555e11c [2024-11-28 03:39:21,951 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/data/78e06bf43/45ef41ed2161456b9f113f2c1a770525 [2024-11-28 03:39:21,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:39:21,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:39:21,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:39:21,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:39:21,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:39:21,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:21" (1/1) ... [2024-11-28 03:39:21,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27fde38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:21, skipping insertion in model container [2024-11-28 03:39:21,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:21" (1/1) ... [2024-11-28 03:39:22,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:39:22,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:39:22,417 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:39:22,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:39:22,519 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:39:22,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22 WrapperNode [2024-11-28 03:39:22,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:39:22,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:39:22,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:39:22,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:39:22,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,601 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2024-11-28 03:39:22,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:39:22,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:39:22,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:39:22,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:39:22,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,656 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2024-11-28 03:39:22,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:39:22,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:39:22,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:39:22,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:39:22,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (1/1) ... [2024-11-28 03:39:22,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:39:22,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:22,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:39:22,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:39:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-28 03:39:22,797 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-28 03:39:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:39:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:39:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:39:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:39:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:39:22,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:39:22,950 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:39:22,953 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:39:22,986 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-28 03:39:23,651 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-28 03:39:23,651 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:39:23,675 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:39:23,676 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 03:39:23,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:23 BoogieIcfgContainer [2024-11-28 03:39:23,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:39:23,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:39:23,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:39:23,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:39:23,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:39:21" (1/3) ... [2024-11-28 03:39:23,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43054440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:23, skipping insertion in model container [2024-11-28 03:39:23,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:22" (2/3) ... [2024-11-28 03:39:23,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43054440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:23, skipping insertion in model container [2024-11-28 03:39:23,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:23" (3/3) ... [2024-11-28 03:39:23,694 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2024-11-28 03:39:23,715 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:39:23,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_nondet_free_order-1.i that has 2 procedures, 141 locations, 1 initial locations, 1 loop locations, and 62 error locations. [2024-11-28 03:39:23,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:39:23,811 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@5ab8bec4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:39:23,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-28 03:39:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 75 states have (on average 1.9466666666666668) internal successors, (146), 138 states have internal predecessors, (146), 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) [2024-11-28 03:39:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 03:39:23,824 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:23,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 03:39:23,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:23,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:23,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-28 03:39:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:23,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74871358] [2024-11-28 03:39:23,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:23,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:24,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:24,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74871358] [2024-11-28 03:39:24,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74871358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:24,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:24,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:39:24,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179269222] [2024-11-28 03:39:24,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:24,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:39:24,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:24,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:39:24,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:39:24,149 INFO L87 Difference]: Start difference. First operand has 140 states, 75 states have (on average 1.9466666666666668) internal successors, (146), 138 states have internal predecessors, (146), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-28 03:39:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:24,345 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2024-11-28 03:39:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:39:24,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-28 03:39:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:24,358 INFO L225 Difference]: With dead ends: 137 [2024-11-28 03:39:24,358 INFO L226 Difference]: Without dead ends: 131 [2024-11-28 03:39:24,362 INFO L434 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 [2024-11-28 03:39:24,368 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 18 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:24,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 207 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:39:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-28 03:39:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-28 03:39:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 130 states have internal predecessors, (136), 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) [2024-11-28 03:39:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2024-11-28 03:39:24,437 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 4 [2024-11-28 03:39:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:24,437 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2024-11-28 03:39:24,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-28 03:39:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2024-11-28 03:39:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 03:39:24,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:24,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 03:39:24,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:39:24,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:24,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-28 03:39:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:24,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487502298] [2024-11-28 03:39:24,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:24,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:24,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487502298] [2024-11-28 03:39:24,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487502298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:24,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:24,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:39:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542111968] [2024-11-28 03:39:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:24,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:39:24,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:24,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:39:24,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:39:24,656 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-28 03:39:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:24,730 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2024-11-28 03:39:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:39:24,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-28 03:39:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:24,736 INFO L225 Difference]: With dead ends: 128 [2024-11-28 03:39:24,736 INFO L226 Difference]: Without dead ends: 128 [2024-11-28 03:39:24,736 INFO L434 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 [2024-11-28 03:39:24,737 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 16 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:24,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 229 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:39:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-28 03:39:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-28 03:39:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 127 states have internal predecessors, (133), 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) [2024-11-28 03:39:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2024-11-28 03:39:24,749 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 4 [2024-11-28 03:39:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:24,749 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2024-11-28 03:39:24,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-28 03:39:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2024-11-28 03:39:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 03:39:24,750 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:24,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:24,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:39:24,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:24,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248185, now seen corresponding path program 1 times [2024-11-28 03:39:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:24,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603720903] [2024-11-28 03:39:24,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:24,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:24,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:24,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603720903] [2024-11-28 03:39:24,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603720903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:24,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:24,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:39:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29296340] [2024-11-28 03:39:24,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:24,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:39:24,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:24,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:39:24,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:39:24,906 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-11-28 03:39:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:24,939 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2024-11-28 03:39:24,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:39:24,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-28 03:39:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:24,941 INFO L225 Difference]: With dead ends: 138 [2024-11-28 03:39:24,941 INFO L226 Difference]: Without dead ends: 138 [2024-11-28 03:39:24,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:39:24,942 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 9 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:24,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 255 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:39:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-28 03:39:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2024-11-28 03:39:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 128 states have internal predecessors, (134), 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) [2024-11-28 03:39:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2024-11-28 03:39:24,956 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 9 [2024-11-28 03:39:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:24,956 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2024-11-28 03:39:24,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-11-28 03:39:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2024-11-28 03:39:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 03:39:24,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:24,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:24,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:39:24,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:24,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:24,958 INFO L85 PathProgramCache]: Analyzing trace with hash -401893041, now seen corresponding path program 1 times [2024-11-28 03:39:24,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:24,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978690871] [2024-11-28 03:39:24,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:24,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:25,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:25,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978690871] [2024-11-28 03:39:25,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978690871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:25,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:25,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:39:25,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131196727] [2024-11-28 03:39:25,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:25,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:39:25,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:25,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:39:25,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:39:25,039 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-28 03:39:25,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:25,171 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2024-11-28 03:39:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:39:25,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 [2024-11-28 03:39:25,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:25,174 INFO L225 Difference]: With dead ends: 128 [2024-11-28 03:39:25,174 INFO L226 Difference]: Without dead ends: 128 [2024-11-28 03:39:25,174 INFO L434 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 [2024-11-28 03:39:25,175 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:25,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 207 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:39:25,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-28 03:39:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-28 03:39:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 73 states have (on average 1.821917808219178) internal successors, (133), 127 states have internal predecessors, (133), 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) [2024-11-28 03:39:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2024-11-28 03:39:25,191 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 10 [2024-11-28 03:39:25,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:25,196 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2024-11-28 03:39:25,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-28 03:39:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2024-11-28 03:39:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 03:39:25,197 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:25,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:25,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:39:25,197 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:25,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash -401893040, now seen corresponding path program 1 times [2024-11-28 03:39:25,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:25,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497183735] [2024-11-28 03:39:25,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:25,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:25,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:25,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497183735] [2024-11-28 03:39:25,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497183735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:25,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:25,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:39:25,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742704835] [2024-11-28 03:39:25,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:25,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:39:25,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:25,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:39:25,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:39:25,345 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-28 03:39:25,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:25,386 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2024-11-28 03:39:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:39:25,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 [2024-11-28 03:39:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:25,388 INFO L225 Difference]: With dead ends: 127 [2024-11-28 03:39:25,388 INFO L226 Difference]: Without dead ends: 127 [2024-11-28 03:39:25,388 INFO L434 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 [2024-11-28 03:39:25,389 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:25,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 239 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:39:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-28 03:39:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-28 03:39:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 126 states have internal predecessors, (132), 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) [2024-11-28 03:39:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2024-11-28 03:39:25,397 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 10 [2024-11-28 03:39:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:25,397 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2024-11-28 03:39:25,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-28 03:39:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2024-11-28 03:39:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:39:25,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:25,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:25,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:39:25,399 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:25,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash 426217629, now seen corresponding path program 1 times [2024-11-28 03:39:25,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:25,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881350776] [2024-11-28 03:39:25,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:25,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:25,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:25,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881350776] [2024-11-28 03:39:25,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881350776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:25,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:25,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:39:25,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191795134] [2024-11-28 03:39:25,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:25,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:39:25,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:25,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:39:25,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:39:25,623 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-28 03:39:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:25,850 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2024-11-28 03:39:25,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:39:25,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2024-11-28 03:39:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:25,851 INFO L225 Difference]: With dead ends: 131 [2024-11-28 03:39:25,851 INFO L226 Difference]: Without dead ends: 131 [2024-11-28 03:39:25,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:39:25,852 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 18 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:25,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 270 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:39:25,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-28 03:39:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-28 03:39:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7792207792207793) internal successors, (137), 130 states have internal predecessors, (137), 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) [2024-11-28 03:39:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2024-11-28 03:39:25,870 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 11 [2024-11-28 03:39:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:25,871 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2024-11-28 03:39:25,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-28 03:39:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2024-11-28 03:39:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:39:25,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:25,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:25,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:39:25,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:25,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash 426217630, now seen corresponding path program 1 times [2024-11-28 03:39:25,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:25,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815911741] [2024-11-28 03:39:25,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:26,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:26,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815911741] [2024-11-28 03:39:26,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815911741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:26,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:26,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:39:26,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403687467] [2024-11-28 03:39:26,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:26,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:39:26,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:26,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:39:26,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:39:26,156 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2024-11-28 03:39:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:26,266 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2024-11-28 03:39:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:39:26,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2024-11-28 03:39:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:26,267 INFO L225 Difference]: With dead ends: 131 [2024-11-28 03:39:26,268 INFO L226 Difference]: Without dead ends: 131 [2024-11-28 03:39:26,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:39:26,269 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 35 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:26,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 336 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:39:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-28 03:39:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-28 03:39:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 130 states have internal predecessors, (136), 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) [2024-11-28 03:39:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2024-11-28 03:39:26,283 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 11 [2024-11-28 03:39:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:26,283 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2024-11-28 03:39:26,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2024-11-28 03:39:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2024-11-28 03:39:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 03:39:26,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:26,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:26,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:39:26,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:26,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:26,289 INFO L85 PathProgramCache]: Analyzing trace with hash 63621712, now seen corresponding path program 1 times [2024-11-28 03:39:26,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:26,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827958821] [2024-11-28 03:39:26,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:26,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:26,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:26,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827958821] [2024-11-28 03:39:26,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827958821] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:39:26,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099348106] [2024-11-28 03:39:26,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:26,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:26,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:26,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:39:26,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:39:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:26,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:39:26,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:26,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:39:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099348106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:39:26,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:39:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-28 03:39:26,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464304641] [2024-11-28 03:39:26,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:39:26,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:39:26,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:26,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:39:26,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:39:26,662 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2024-11-28 03:39:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:26,685 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2024-11-28 03:39:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:39:26,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 15 [2024-11-28 03:39:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:26,686 INFO L225 Difference]: With dead ends: 133 [2024-11-28 03:39:26,686 INFO L226 Difference]: Without dead ends: 133 [2024-11-28 03:39:26,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:39:26,687 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 7 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:26,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 257 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:39:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-28 03:39:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-28 03:39:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 79 states have (on average 1.7468354430379747) internal successors, (138), 132 states have internal predecessors, (138), 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) [2024-11-28 03:39:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2024-11-28 03:39:26,700 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 15 [2024-11-28 03:39:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:26,700 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2024-11-28 03:39:26,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2024-11-28 03:39:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2024-11-28 03:39:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 03:39:26,701 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:26,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:26,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:39:26,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:26,906 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:26,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:26,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1008525684, now seen corresponding path program 1 times [2024-11-28 03:39:26,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:26,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555143365] [2024-11-28 03:39:26,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:26,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:27,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555143365] [2024-11-28 03:39:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555143365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:39:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885922363] [2024-11-28 03:39:27,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:27,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:27,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:27,095 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:39:27,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:39:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:27,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 03:39:27,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:27,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:39:27,302 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 03:39:27,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 03:39:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:27,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:39:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885922363] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:39:27,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:39:27,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-28 03:39:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079254088] [2024-11-28 03:39:27,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:39:27,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:39:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:27,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:39:27,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:39:27,391 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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) [2024-11-28 03:39:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:27,581 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2024-11-28 03:39:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:39:27,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 17 [2024-11-28 03:39:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:27,586 INFO L225 Difference]: With dead ends: 131 [2024-11-28 03:39:27,586 INFO L226 Difference]: Without dead ends: 131 [2024-11-28 03:39:27,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:39:27,587 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 7 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:27,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 278 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:39:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-28 03:39:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-28 03:39:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 79 states have (on average 1.7215189873417722) internal successors, (136), 130 states have internal predecessors, (136), 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) [2024-11-28 03:39:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2024-11-28 03:39:27,597 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 17 [2024-11-28 03:39:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:27,600 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2024-11-28 03:39:27,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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) [2024-11-28 03:39:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2024-11-28 03:39:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 03:39:27,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:27,601 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:27,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:39:27,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:27,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:27,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:27,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1008525685, now seen corresponding path program 1 times [2024-11-28 03:39:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:27,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327357046] [2024-11-28 03:39:27,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:27,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:27,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:28,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327357046] [2024-11-28 03:39:28,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327357046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:39:28,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489144513] [2024-11-28 03:39:28,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:28,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:28,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:28,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:39:28,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:39:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:28,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 03:39:28,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:28,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:39:28,216 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 03:39:28,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 03:39:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:28,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:39:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:28,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489144513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:39:28,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:39:28,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-11-28 03:39:28,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480932824] [2024-11-28 03:39:28,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:39:28,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:39:28,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:28,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:39:28,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:39:28,481 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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) [2024-11-28 03:39:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:28,592 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2024-11-28 03:39:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:39:28,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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 17 [2024-11-28 03:39:28,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:28,594 INFO L225 Difference]: With dead ends: 129 [2024-11-28 03:39:28,594 INFO L226 Difference]: Without dead ends: 129 [2024-11-28 03:39:28,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:39:28,595 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 6 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:28,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 454 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:39:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-28 03:39:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-28 03:39:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 79 states have (on average 1.6962025316455696) internal successors, (134), 128 states have internal predecessors, (134), 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) [2024-11-28 03:39:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2024-11-28 03:39:28,602 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 17 [2024-11-28 03:39:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:28,602 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2024-11-28 03:39:28,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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) [2024-11-28 03:39:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2024-11-28 03:39:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 03:39:28,603 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:28,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:28,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:39:28,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:28,808 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:28,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1069225011, now seen corresponding path program 1 times [2024-11-28 03:39:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:28,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672692004] [2024-11-28 03:39:28,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:28,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:39:28,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:28,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672692004] [2024-11-28 03:39:28,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672692004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:28,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:28,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:39:28,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806263772] [2024-11-28 03:39:28,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:28,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:39:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:28,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:39:28,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:39:28,979 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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) [2024-11-28 03:39:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:29,236 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2024-11-28 03:39:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:39:29,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 24 [2024-11-28 03:39:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:29,238 INFO L225 Difference]: With dead ends: 126 [2024-11-28 03:39:29,238 INFO L226 Difference]: Without dead ends: 126 [2024-11-28 03:39:29,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:39:29,239 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 25 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:29,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 382 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:39:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-28 03:39:29,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-28 03:39:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 79 states have (on average 1.6582278481012658) internal successors, (131), 125 states have internal predecessors, (131), 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) [2024-11-28 03:39:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2024-11-28 03:39:29,245 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 24 [2024-11-28 03:39:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:29,245 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2024-11-28 03:39:29,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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) [2024-11-28 03:39:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2024-11-28 03:39:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 03:39:29,249 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:29,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:29,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:39:29,249 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:29,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:29,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1069225012, now seen corresponding path program 1 times [2024-11-28 03:39:29,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:29,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390149910] [2024-11-28 03:39:29,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:29,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:39:29,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:29,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390149910] [2024-11-28 03:39:29,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390149910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:29,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:29,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:39:29,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904352783] [2024-11-28 03:39:29,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:29,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:39:29,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:29,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:39:29,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:39:29,647 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2024-11-28 03:39:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:29,830 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2024-11-28 03:39:29,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:39:29,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 24 [2024-11-28 03:39:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:29,832 INFO L225 Difference]: With dead ends: 119 [2024-11-28 03:39:29,832 INFO L226 Difference]: Without dead ends: 119 [2024-11-28 03:39:29,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:39:29,833 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 40 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:29,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 546 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:39:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-28 03:39:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-28 03:39:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 118 states have internal predecessors, (124), 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) [2024-11-28 03:39:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2024-11-28 03:39:29,839 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 24 [2024-11-28 03:39:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:29,839 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2024-11-28 03:39:29,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2024-11-28 03:39:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2024-11-28 03:39:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 03:39:29,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:29,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:29,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:39:29,841 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:29,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash 78875127, now seen corresponding path program 1 times [2024-11-28 03:39:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:29,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399764348] [2024-11-28 03:39:29,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:29,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:39:30,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:30,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399764348] [2024-11-28 03:39:30,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399764348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:30,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:30,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:39:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710930024] [2024-11-28 03:39:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:30,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:39:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:30,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:39:30,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:39:30,105 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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) [2024-11-28 03:39:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:30,340 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2024-11-28 03:39:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:39:30,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 30 [2024-11-28 03:39:30,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:30,341 INFO L225 Difference]: With dead ends: 114 [2024-11-28 03:39:30,341 INFO L226 Difference]: Without dead ends: 114 [2024-11-28 03:39:30,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:39:30,342 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 44 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:30,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 310 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:39:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-28 03:39:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-28 03:39:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 79 states have (on average 1.5063291139240507) internal successors, (119), 113 states have internal predecessors, (119), 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) [2024-11-28 03:39:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2024-11-28 03:39:30,348 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 30 [2024-11-28 03:39:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:30,348 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2024-11-28 03:39:30,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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) [2024-11-28 03:39:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2024-11-28 03:39:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 03:39:30,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:30,349 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:30,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:39:30,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:30,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:30,350 INFO L85 PathProgramCache]: Analyzing trace with hash 78914109, now seen corresponding path program 1 times [2024-11-28 03:39:30,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:30,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636056080] [2024-11-28 03:39:30,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:30,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:39:31,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:31,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636056080] [2024-11-28 03:39:31,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636056080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:31,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:31,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:39:31,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747884451] [2024-11-28 03:39:31,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:31,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:39:31,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:31,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:39:31,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:39:31,010 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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) [2024-11-28 03:39:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:31,228 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2024-11-28 03:39:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:39:31,229 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 30 [2024-11-28 03:39:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:31,230 INFO L225 Difference]: With dead ends: 109 [2024-11-28 03:39:31,230 INFO L226 Difference]: Without dead ends: 109 [2024-11-28 03:39:31,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:39:31,231 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 67 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:31,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 566 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:39:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-28 03:39:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-28 03:39:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 108 states have internal predecessors, (114), 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) [2024-11-28 03:39:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2024-11-28 03:39:31,234 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 30 [2024-11-28 03:39:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:31,235 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2024-11-28 03:39:31,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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) [2024-11-28 03:39:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2024-11-28 03:39:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 03:39:31,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:31,236 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:31,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:39:31,236 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:31,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash 78912893, now seen corresponding path program 1 times [2024-11-28 03:39:31,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:31,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241179021] [2024-11-28 03:39:31,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:32,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241179021] [2024-11-28 03:39:32,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241179021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:39:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796447322] [2024-11-28 03:39:32,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:32,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:32,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:32,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:39:32,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:39:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:32,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-28 03:39:32,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:32,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:39:32,435 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-28 03:39:32,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 03:39:32,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:39:32,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:39:32,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:39:32,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-28 03:39:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:32,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:39:32,743 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2024-11-28 03:39:32,757 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2024-11-28 03:39:32,768 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_462) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2024-11-28 03:39:32,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:32,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-28 03:39:32,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2024-11-28 03:39:32,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-28 03:39:32,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-28 03:39:33,204 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:39:33,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-28 03:39:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-28 03:39:33,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796447322] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:39:33,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:39:33,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 28 [2024-11-28 03:39:33,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818059303] [2024-11-28 03:39:33,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:39:33,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 03:39:33,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:33,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 03:39:33,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=574, Unknown=3, NotChecked=150, Total=812 [2024-11-28 03:39:33,218 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 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) [2024-11-28 03:39:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:34,148 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2024-11-28 03:39:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 03:39:34,149 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 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 30 [2024-11-28 03:39:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:34,150 INFO L225 Difference]: With dead ends: 108 [2024-11-28 03:39:34,150 INFO L226 Difference]: Without dead ends: 108 [2024-11-28 03:39:34,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=194, Invalid=1075, Unknown=3, NotChecked=210, Total=1482 [2024-11-28 03:39:34,152 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 80 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:34,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 866 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 492 Invalid, 0 Unknown, 231 Unchecked, 0.5s Time] [2024-11-28 03:39:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-28 03:39:34,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2024-11-28 03:39:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.379746835443038) internal successors, (109), 103 states have internal predecessors, (109), 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) [2024-11-28 03:39:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2024-11-28 03:39:34,156 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 30 [2024-11-28 03:39:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:34,157 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2024-11-28 03:39:34,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 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) [2024-11-28 03:39:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2024-11-28 03:39:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:39:34,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:34,158 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:34,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 03:39:34,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:34,359 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:34,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1848629736, now seen corresponding path program 1 times [2024-11-28 03:39:34,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:34,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686822559] [2024-11-28 03:39:34,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:34,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:39:34,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:34,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686822559] [2024-11-28 03:39:34,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686822559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:34,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:34,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:39:34,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202601093] [2024-11-28 03:39:34,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:34,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:39:34,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:34,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:39:34,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:39:34,917 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 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) [2024-11-28 03:39:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:35,375 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2024-11-28 03:39:35,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:39:35,376 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 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) Word has length 31 [2024-11-28 03:39:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:35,377 INFO L225 Difference]: With dead ends: 99 [2024-11-28 03:39:35,377 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 03:39:35,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:39:35,378 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 71 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:35,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 296 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:39:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 03:39:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-28 03:39:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 98 states have internal predecessors, (104), 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) [2024-11-28 03:39:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2024-11-28 03:39:35,383 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 31 [2024-11-28 03:39:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:35,383 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2024-11-28 03:39:35,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 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) [2024-11-28 03:39:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2024-11-28 03:39:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:39:35,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:35,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:35,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:39:35,386 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:35,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1848667470, now seen corresponding path program 1 times [2024-11-28 03:39:35,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:35,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731782386] [2024-11-28 03:39:35,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:35,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:36,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:36,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731782386] [2024-11-28 03:39:36,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731782386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:39:36,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921493857] [2024-11-28 03:39:36,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:36,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:36,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:36,159 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:39:36,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:39:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:36,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-28 03:39:36,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:36,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:39:36,433 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 03:39:36,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 03:39:36,576 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-28 03:39:36,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 03:39:36,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:39:36,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:39:36,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2024-11-28 03:39:36,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2024-11-28 03:39:37,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:37,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 31 [2024-11-28 03:39:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:37,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:39:37,554 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-28 03:39:37,640 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_584) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-28 03:39:37,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:37,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-28 03:39:37,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2024-11-28 03:39:37,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-28 03:39:37,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-28 03:39:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-28 03:39:38,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921493857] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:39:38,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:39:38,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 33 [2024-11-28 03:39:38,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767003998] [2024-11-28 03:39:38,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:39:38,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 03:39:38,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:38,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 03:39:38,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=884, Unknown=5, NotChecked=122, Total=1122 [2024-11-28 03:39:38,128 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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) [2024-11-28 03:39:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:39,690 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2024-11-28 03:39:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 03:39:39,691 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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 31 [2024-11-28 03:39:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:39,691 INFO L225 Difference]: With dead ends: 98 [2024-11-28 03:39:39,692 INFO L226 Difference]: Without dead ends: 98 [2024-11-28 03:39:39,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=209, Invalid=1354, Unknown=5, NotChecked=154, Total=1722 [2024-11-28 03:39:39,694 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 95 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:39,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 727 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1022 Invalid, 0 Unknown, 174 Unchecked, 1.0s Time] [2024-11-28 03:39:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-28 03:39:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-28 03:39:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 93 states have internal predecessors, (99), 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) [2024-11-28 03:39:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-28 03:39:39,698 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 31 [2024-11-28 03:39:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:39,698 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-28 03:39:39,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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) [2024-11-28 03:39:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-28 03:39:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 03:39:39,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:39,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:39,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 03:39:39,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:39,904 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:39,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:39,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1472946785, now seen corresponding path program 1 times [2024-11-28 03:39:39,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:39,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183129455] [2024-11-28 03:39:39,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:39,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:39:40,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:40,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183129455] [2024-11-28 03:39:40,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183129455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:40,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:39:40,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:39:40,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324942024] [2024-11-28 03:39:40,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:40,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:39:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:40,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:39:40,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:39:40,364 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 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) [2024-11-28 03:39:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:40,673 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2024-11-28 03:39:40,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:39:40,674 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 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 32 [2024-11-28 03:39:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:40,675 INFO L225 Difference]: With dead ends: 93 [2024-11-28 03:39:40,675 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 03:39:40,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:39:40,676 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:40,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 314 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:39:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 03:39:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-28 03:39:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.240506329113924) internal successors, (98), 92 states have internal predecessors, (98), 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) [2024-11-28 03:39:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2024-11-28 03:39:40,682 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 32 [2024-11-28 03:39:40,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:40,682 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2024-11-28 03:39:40,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 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) [2024-11-28 03:39:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2024-11-28 03:39:40,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 03:39:40,683 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:40,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:40,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:39:40,683 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:40,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:40,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1474116577, now seen corresponding path program 1 times [2024-11-28 03:39:40,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:40,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340509332] [2024-11-28 03:39:40,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:40,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:41,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:41,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340509332] [2024-11-28 03:39:41,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340509332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:39:41,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204332328] [2024-11-28 03:39:41,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:41,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:41,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:41,254 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:39:41,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:39:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:41,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-28 03:39:41,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:41,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:39:41,553 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-28 03:39:41,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 03:39:41,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:39:41,647 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:39:41,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-28 03:39:41,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-28 03:39:41,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-28 03:39:41,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:41,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2024-11-28 03:39:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:41,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:39:41,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_705 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_705) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2024-11-28 03:39:42,002 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_705 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_705) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2024-11-28 03:39:42,018 INFO L349 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2024-11-28 03:39:42,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2024-11-28 03:39:42,024 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_705) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) is different from false [2024-11-28 03:39:42,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:42,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-28 03:39:42,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2024-11-28 03:39:42,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-28 03:39:42,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-28 03:39:42,157 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:39:42,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-28 03:39:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-28 03:39:42,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204332328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:39:42,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:39:42,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 29 [2024-11-28 03:39:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389451849] [2024-11-28 03:39:42,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:39:42,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 03:39:42,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:42,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 03:39:42,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=630, Unknown=3, NotChecked=156, Total=870 [2024-11-28 03:39:42,171 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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) [2024-11-28 03:39:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:43,089 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-28 03:39:43,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:39:43,090 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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 32 [2024-11-28 03:39:43,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:43,091 INFO L225 Difference]: With dead ends: 92 [2024-11-28 03:39:43,091 INFO L226 Difference]: Without dead ends: 92 [2024-11-28 03:39:43,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=1096, Unknown=3, NotChecked=210, Total=1482 [2024-11-28 03:39:43,093 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 43 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:43,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 955 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 775 Invalid, 0 Unknown, 160 Unchecked, 0.6s Time] [2024-11-28 03:39:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-28 03:39:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-28 03:39:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 91 states have internal predecessors, (97), 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) [2024-11-28 03:39:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-28 03:39:43,097 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 32 [2024-11-28 03:39:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:43,097 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-28 03:39:43,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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) [2024-11-28 03:39:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-28 03:39:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 03:39:43,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:43,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:43,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:39:43,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:43,299 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:43,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1720288021, now seen corresponding path program 1 times [2024-11-28 03:39:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754763511] [2024-11-28 03:39:43,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:43,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:44,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:44,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754763511] [2024-11-28 03:39:44,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754763511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:39:44,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729348944] [2024-11-28 03:39:44,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:44,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:44,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:44,009 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:39:44,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:39:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:44,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 03:39:44,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:44,284 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:39:44,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:39:44,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:39:44,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:44,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-28 03:39:44,798 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 03:39:44,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-11-28 03:39:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:44,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:39:45,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-28 03:39:45,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-28 03:39:45,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 03:39:45,129 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:39:45,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-28 03:39:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:45,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729348944] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:39:45,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:39:45,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 28 [2024-11-28 03:39:45,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564111397] [2024-11-28 03:39:45,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:39:45,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 03:39:45,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:45,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 03:39:45,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2024-11-28 03:39:45,142 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 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) [2024-11-28 03:39:45,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:45,950 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-28 03:39:45,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:39:45,951 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 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 35 [2024-11-28 03:39:45,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:45,951 INFO L225 Difference]: With dead ends: 91 [2024-11-28 03:39:45,952 INFO L226 Difference]: Without dead ends: 91 [2024-11-28 03:39:45,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2024-11-28 03:39:45,953 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 69 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:45,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 707 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:39:45,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-28 03:39:45,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-28 03:39:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 90 states have internal predecessors, (96), 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) [2024-11-28 03:39:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2024-11-28 03:39:45,962 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 35 [2024-11-28 03:39:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:45,962 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2024-11-28 03:39:45,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 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) [2024-11-28 03:39:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2024-11-28 03:39:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 03:39:45,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:45,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:45,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 03:39:46,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:46,168 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:46,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1719857045, now seen corresponding path program 1 times [2024-11-28 03:39:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:46,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234971960] [2024-11-28 03:39:46,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:46,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:46,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:46,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234971960] [2024-11-28 03:39:46,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234971960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:39:46,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318942909] [2024-11-28 03:39:46,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:46,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:46,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:46,967 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:39:46,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:39:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:47,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 03:39:47,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:47,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:39:47,208 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-28 03:39:47,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 03:39:47,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:39:47,263 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:39:47,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-28 03:39:47,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-28 03:39:47,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 03:39:47,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:47,527 INFO L378 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 33 treesize of output 33 [2024-11-28 03:39:47,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:39:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:47,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:39:48,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_872 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_872) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)) (forall ((v_ArrVal_872 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_872) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-28 03:39:48,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:48,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2024-11-28 03:39:48,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:48,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-28 03:39:48,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2024-11-28 03:39:48,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2024-11-28 03:39:48,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 85 [2024-11-28 03:39:48,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:48,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 96 [2024-11-28 03:39:48,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:48,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-28 03:39:48,582 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:39:48,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-28 03:39:48,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:48,608 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:39:48,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-28 03:39:48,949 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:39:48,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-28 03:39:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-28 03:39:48,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318942909] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:39:48,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:39:48,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 34 [2024-11-28 03:39:48,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236192121] [2024-11-28 03:39:48,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:39:48,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 03:39:48,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:48,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 03:39:48,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1012, Unknown=23, NotChecked=64, Total=1190 [2024-11-28 03:39:48,962 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 35 states have internal predecessors, (72), 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) [2024-11-28 03:39:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:50,635 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-11-28 03:39:50,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 03:39:50,636 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 35 states have internal predecessors, (72), 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 35 [2024-11-28 03:39:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:50,637 INFO L225 Difference]: With dead ends: 94 [2024-11-28 03:39:50,637 INFO L226 Difference]: Without dead ends: 94 [2024-11-28 03:39:50,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=213, Invalid=1837, Unknown=24, NotChecked=88, Total=2162 [2024-11-28 03:39:50,639 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 75 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:50,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1052 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1196 Invalid, 0 Unknown, 72 Unchecked, 1.0s Time] [2024-11-28 03:39:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-28 03:39:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-28 03:39:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 89 states have internal predecessors, (95), 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) [2024-11-28 03:39:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-28 03:39:50,643 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 35 [2024-11-28 03:39:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:50,643 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-28 03:39:50,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 35 states have internal predecessors, (72), 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) [2024-11-28 03:39:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-28 03:39:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 03:39:50,644 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:50,644 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:50,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 03:39:50,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:50,849 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:50,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:50,849 INFO L85 PathProgramCache]: Analyzing trace with hash 465350691, now seen corresponding path program 1 times [2024-11-28 03:39:50,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:50,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599701749] [2024-11-28 03:39:50,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:50,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:51,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599701749] [2024-11-28 03:39:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599701749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:39:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988473533] [2024-11-28 03:39:51,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:51,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:51,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:51,952 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:39:51,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:39:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:52,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 03:39:52,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:52,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:39:52,215 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:39:52,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:39:52,389 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 03:39:52,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 03:39:52,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-28 03:39:52,514 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:39:52,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-28 03:39:52,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 03:39:52,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-11-28 03:39:52,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:52,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 24 [2024-11-28 03:39:53,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:39:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:53,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:39:53,526 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_958 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) (forall ((v_ArrVal_958 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2024-11-28 03:39:53,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:53,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2024-11-28 03:39:53,568 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_3) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2024-11-28 03:39:53,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:53,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-28 03:39:53,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2024-11-28 03:39:53,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-28 03:39:53,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-28 03:39:53,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:53,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-28 03:39:53,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:39:53,633 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:39:53,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2024-11-28 03:39:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-28 03:39:54,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988473533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:39:54,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:39:54,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 48 [2024-11-28 03:39:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927917353] [2024-11-28 03:39:54,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:39:54,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-28 03:39:54,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:54,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-28 03:39:54,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1993, Unknown=13, NotChecked=182, Total=2352 [2024-11-28 03:39:54,164 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 49 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 49 states have internal predecessors, (85), 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) [2024-11-28 03:39:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:56,265 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2024-11-28 03:39:56,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 03:39:56,266 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 49 states have internal predecessors, (85), 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 36 [2024-11-28 03:39:56,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:56,267 INFO L225 Difference]: With dead ends: 93 [2024-11-28 03:39:56,267 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 03:39:56,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=411, Invalid=3873, Unknown=14, NotChecked=258, Total=4556 [2024-11-28 03:39:56,271 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 95 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:56,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1272 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1538 Invalid, 0 Unknown, 122 Unchecked, 1.1s Time] [2024-11-28 03:39:56,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 03:39:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-28 03:39:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 88 states have internal predecessors, (94), 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) [2024-11-28 03:39:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-28 03:39:56,275 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 36 [2024-11-28 03:39:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:56,276 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-28 03:39:56,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 49 states have internal predecessors, (85), 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) [2024-11-28 03:39:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-28 03:39:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 03:39:56,277 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:56,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:56,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 03:39:56,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 03:39:56,478 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:56,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash 464919715, now seen corresponding path program 1 times [2024-11-28 03:39:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:56,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480980695] [2024-11-28 03:39:56,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:56,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:57,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:39:57,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480980695] [2024-11-28 03:39:57,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480980695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:39:57,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394915552] [2024-11-28 03:39:57,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:57,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:57,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:57,126 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:39:57,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:39:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:57,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 03:39:57,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:57,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:39:57,346 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 03:39:57,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 03:39:57,382 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 03:39:57,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 03:39:57,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:39:57,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:57,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-28 03:39:58,054 INFO L349 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2024-11-28 03:39:58,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 64 [2024-11-28 03:39:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:39:58,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:39:58,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394915552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:39:58,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:39:58,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 24 [2024-11-28 03:39:58,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245214964] [2024-11-28 03:39:58,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:39:58,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:39:58,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:39:58,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:39:58,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2024-11-28 03:39:58,355 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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) [2024-11-28 03:39:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:58,951 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-28 03:39:58,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:39:58,952 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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 36 [2024-11-28 03:39:58,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:58,953 INFO L225 Difference]: With dead ends: 88 [2024-11-28 03:39:58,953 INFO L226 Difference]: Without dead ends: 88 [2024-11-28 03:39:58,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2024-11-28 03:39:58,954 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 29 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:58,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 403 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:39:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-28 03:39:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-28 03:39:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 87 states have internal predecessors, (93), 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) [2024-11-28 03:39:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-28 03:39:58,958 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 36 [2024-11-28 03:39:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:58,959 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-28 03:39:58,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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) [2024-11-28 03:39:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-28 03:39:58,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 03:39:58,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:58,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:39:58,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 03:39:59,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 03:39:59,161 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:39:59,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1826505437, now seen corresponding path program 1 times [2024-11-28 03:39:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:39:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54651008] [2024-11-28 03:39:59,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:39:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:00,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:40:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54651008] [2024-11-28 03:40:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54651008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:40:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776530144] [2024-11-28 03:40:00,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:00,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:40:00,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:40:00,209 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:40:00,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:40:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:00,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 03:40:00,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:40:00,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:40:00,464 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:40:00,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:40:00,627 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 03:40:00,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 03:40:00,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-28 03:40:00,736 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:40:00,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-28 03:40:00,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-28 03:40:00,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-28 03:40:01,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:01,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 24 [2024-11-28 03:40:01,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:40:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:01,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:40:01,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 03:40:01,632 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1128 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1128) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1129) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-28 03:40:01,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:01,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-28 03:40:01,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2024-11-28 03:40:01,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 03:40:01,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 03:40:01,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 03:40:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-28 03:40:02,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776530144] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:40:02,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:40:02,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 50 [2024-11-28 03:40:02,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433366751] [2024-11-28 03:40:02,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:40:02,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-28 03:40:02,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:40:02,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-28 03:40:02,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2231, Unknown=20, NotChecked=96, Total=2550 [2024-11-28 03:40:02,168 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 51 states, 50 states have (on average 1.7) internal successors, (85), 51 states have internal predecessors, (85), 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) [2024-11-28 03:40:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:40:03,757 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-28 03:40:03,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-28 03:40:03,757 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.7) internal successors, (85), 51 states have internal predecessors, (85), 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 36 [2024-11-28 03:40:03,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:40:03,758 INFO L225 Difference]: With dead ends: 91 [2024-11-28 03:40:03,758 INFO L226 Difference]: Without dead ends: 91 [2024-11-28 03:40:03,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=402, Invalid=3614, Unknown=20, NotChecked=124, Total=4160 [2024-11-28 03:40:03,760 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 123 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:40:03,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 958 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1109 Invalid, 0 Unknown, 51 Unchecked, 0.9s Time] [2024-11-28 03:40:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-28 03:40:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-28 03:40:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 86 states have internal predecessors, (92), 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) [2024-11-28 03:40:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-28 03:40:03,764 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 36 [2024-11-28 03:40:03,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:40:03,764 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-28 03:40:03,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.7) internal successors, (85), 51 states have internal predecessors, (85), 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) [2024-11-28 03:40:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-28 03:40:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 03:40:03,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:40:03,765 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:40:03,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 03:40:03,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 03:40:03,966 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:40:03,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:40:03,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1826936413, now seen corresponding path program 1 times [2024-11-28 03:40:03,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:40:03,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591585705] [2024-11-28 03:40:03,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:03,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:40:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:04,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:40:04,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591585705] [2024-11-28 03:40:04,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591585705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:40:04,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133346246] [2024-11-28 03:40:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:04,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:40:04,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:40:04,542 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:40:04,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 03:40:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:04,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 03:40:04,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:40:04,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:40:04,746 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-28 03:40:04,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 03:40:04,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:40:04,842 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:40:04,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-28 03:40:04,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-28 03:40:04,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-28 03:40:05,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:05,099 INFO L378 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 2 case distinctions, treesize of input 24 treesize of output 28 [2024-11-28 03:40:05,322 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:40:05,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-28 03:40:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:05,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:40:05,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-28 03:40:05,886 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-28 03:40:05,894 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-28 03:40:05,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:05,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-28 03:40:05,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2024-11-28 03:40:05,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 85 [2024-11-28 03:40:05,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:05,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 96 [2024-11-28 03:40:05,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2024-11-28 03:40:06,166 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:40:06,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-28 03:40:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-28 03:40:06,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133346246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:40:06,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:40:06,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 18] total 41 [2024-11-28 03:40:06,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264114299] [2024-11-28 03:40:06,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:40:06,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-28 03:40:06,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:40:06,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-28 03:40:06,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1429, Unknown=5, NotChecked=154, Total=1722 [2024-11-28 03:40:06,172 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 42 states have internal predecessors, (87), 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) [2024-11-28 03:40:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:40:07,249 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-28 03:40:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 03:40:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 42 states have internal predecessors, (87), 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 36 [2024-11-28 03:40:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:40:07,250 INFO L225 Difference]: With dead ends: 90 [2024-11-28 03:40:07,250 INFO L226 Difference]: Without dead ends: 90 [2024-11-28 03:40:07,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=292, Invalid=2467, Unknown=5, NotChecked=206, Total=2970 [2024-11-28 03:40:07,251 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 109 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:40:07,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1137 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1173 Invalid, 0 Unknown, 132 Unchecked, 0.6s Time] [2024-11-28 03:40:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-28 03:40:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-11-28 03:40:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 85 states have internal predecessors, (91), 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) [2024-11-28 03:40:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-28 03:40:07,254 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 36 [2024-11-28 03:40:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:40:07,254 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-28 03:40:07,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 42 states have internal predecessors, (87), 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) [2024-11-28 03:40:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-28 03:40:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 03:40:07,255 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:40:07,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:40:07,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 03:40:07,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 03:40:07,456 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:40:07,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:40:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1550785902, now seen corresponding path program 1 times [2024-11-28 03:40:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:40:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576861656] [2024-11-28 03:40:07,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:07,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:40:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:08,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:40:08,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576861656] [2024-11-28 03:40:08,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576861656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:40:08,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033654743] [2024-11-28 03:40:08,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:08,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:40:08,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:40:08,570 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:40:08,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 03:40:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:08,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 03:40:08,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:40:08,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:40:08,847 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:40:08,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:40:09,009 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 03:40:09,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 03:40:09,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-28 03:40:09,132 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:40:09,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-28 03:40:09,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 03:40:09,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-28 03:40:09,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:40:09,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:09,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-28 03:40:10,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:40:10,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:40:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:10,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:40:10,835 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1303 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)) (forall ((v_ArrVal_1303 (Array Int Int))) (not (let ((.cse1 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 4) (select .cse1 0))))))) is different from false [2024-11-28 03:40:10,864 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1303 (Array Int Int))) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 0) (select .cse0 4))))) (forall ((v_ArrVal_1303 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)))) is different from false [2024-11-28 03:40:10,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:10,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 85 [2024-11-28 03:40:10,916 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (not (let ((.cse1 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 0) (select .cse1 4))))) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-28 03:40:10,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:10,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-28 03:40:10,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 165 [2024-11-28 03:40:10,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:10,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 98 [2024-11-28 03:40:10,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2024-11-28 03:40:10,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2024-11-28 03:40:11,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:11,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2024-11-28 03:40:11,027 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:11,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2024-11-28 03:40:11,045 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:11,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:11,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 90 [2024-11-28 03:40:11,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2024-11-28 03:40:11,124 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 03:40:11,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2024-11-28 03:40:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-28 03:40:11,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033654743] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:40:11,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:40:11,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 55 [2024-11-28 03:40:11,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442363148] [2024-11-28 03:40:11,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:40:11,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-28 03:40:11,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:40:11,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-28 03:40:11,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2573, Unknown=3, NotChecked=312, Total=3080 [2024-11-28 03:40:11,675 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 56 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 56 states have internal predecessors, (95), 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) [2024-11-28 03:40:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:40:13,928 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-28 03:40:13,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 03:40:13,929 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 56 states have internal predecessors, (95), 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 38 [2024-11-28 03:40:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:40:13,929 INFO L225 Difference]: With dead ends: 89 [2024-11-28 03:40:13,929 INFO L226 Difference]: Without dead ends: 89 [2024-11-28 03:40:13,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=462, Invalid=4949, Unknown=3, NotChecked=438, Total=5852 [2024-11-28 03:40:13,931 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 143 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:40:13,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 907 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1473 Invalid, 0 Unknown, 211 Unchecked, 0.9s Time] [2024-11-28 03:40:13,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-28 03:40:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-28 03:40:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.139240506329114) internal successors, (90), 84 states have internal predecessors, (90), 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) [2024-11-28 03:40:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-28 03:40:13,935 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 38 [2024-11-28 03:40:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:40:13,935 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-28 03:40:13,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 56 states have internal predecessors, (95), 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) [2024-11-28 03:40:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-28 03:40:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 03:40:13,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:40:13,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:40:13,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 03:40:14,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 03:40:14,136 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:40:14,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:40:14,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1596467872, now seen corresponding path program 1 times [2024-11-28 03:40:14,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:40:14,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895864117] [2024-11-28 03:40:14,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:14,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:40:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:15,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:40:15,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895864117] [2024-11-28 03:40:15,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895864117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:40:15,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685829148] [2024-11-28 03:40:15,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:15,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:40:15,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:40:15,150 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:40:15,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 03:40:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:15,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 03:40:15,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:40:15,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:40:15,420 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:40:15,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:40:15,582 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 03:40:15,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 03:40:15,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-28 03:40:15,676 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:40:15,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-28 03:40:15,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-28 03:40:15,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-28 03:40:16,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:40:16,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:16,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-28 03:40:16,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:40:16,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:40:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:16,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:40:17,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:17,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 73 [2024-11-28 03:40:17,636 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (not (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 4) (select .cse0 0))))) (forall ((v_ArrVal_1391 (Array Int Int)) (v_prenex_7 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (forall ((v_ArrVal_1391 (Array Int Int)) (v_prenex_7 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-28 03:40:17,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:17,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-28 03:40:17,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2024-11-28 03:40:17,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:17,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-28 03:40:17,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-28 03:40:17,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-28 03:40:17,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:17,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2024-11-28 03:40:17,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109 [2024-11-28 03:40:17,752 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:17,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2024-11-28 03:40:17,762 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:17,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2024-11-28 03:40:17,768 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:17,790 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-28 03:40:17,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 111 [2024-11-28 03:40:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-28 03:40:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685829148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:40:18,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:40:18,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 57 [2024-11-28 03:40:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662328284] [2024-11-28 03:40:18,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:40:18,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 03:40:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:40:18,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 03:40:18,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2967, Unknown=1, NotChecked=110, Total=3306 [2024-11-28 03:40:18,401 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 58 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 58 states have internal predecessors, (95), 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) [2024-11-28 03:40:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:40:20,605 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-28 03:40:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 03:40:20,605 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 58 states have internal predecessors, (95), 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 38 [2024-11-28 03:40:20,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:40:20,606 INFO L225 Difference]: With dead ends: 88 [2024-11-28 03:40:20,606 INFO L226 Difference]: Without dead ends: 88 [2024-11-28 03:40:20,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=455, Invalid=4804, Unknown=1, NotChecked=142, Total=5402 [2024-11-28 03:40:20,608 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 136 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:40:20,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 887 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1413 Invalid, 0 Unknown, 61 Unchecked, 1.1s Time] [2024-11-28 03:40:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-28 03:40:20,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-11-28 03:40:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 83 states have internal predecessors, (89), 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) [2024-11-28 03:40:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-28 03:40:20,612 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 38 [2024-11-28 03:40:20,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:40:20,612 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-28 03:40:20,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 58 states have internal predecessors, (95), 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) [2024-11-28 03:40:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-28 03:40:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 03:40:20,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:40:20,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:40:20,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-28 03:40:20,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-28 03:40:20,818 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:40:20,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:40:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash -891789297, now seen corresponding path program 1 times [2024-11-28 03:40:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:40:20,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694509571] [2024-11-28 03:40:20,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:40:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:21,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:40:21,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694509571] [2024-11-28 03:40:21,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694509571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:40:21,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654869343] [2024-11-28 03:40:21,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:21,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:40:21,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:40:21,578 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:40:21,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 03:40:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:21,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-28 03:40:21,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:40:21,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:40:21,855 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-28 03:40:21,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 03:40:21,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:40:21,957 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:40:21,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-28 03:40:22,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-28 03:40:22,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-28 03:40:22,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:40:22,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:22,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 39 [2024-11-28 03:40:22,513 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:40:22,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-28 03:40:22,654 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:40:22,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2024-11-28 03:40:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:22,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:40:23,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2024-11-28 03:40:23,119 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1481 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1481) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_1481 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1481) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2024-11-28 03:40:23,158 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1481 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1481 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-28 03:40:23,171 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1480) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1480) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-28 03:40:23,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:23,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-28 03:40:23,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2024-11-28 03:40:23,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 85 [2024-11-28 03:40:23,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2024-11-28 03:40:23,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:23,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 96 [2024-11-28 03:40:23,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:23,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-28 03:40:23,267 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:23,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2024-11-28 03:40:23,274 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:23,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-11-28 03:40:23,285 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:23,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 03:40:23,447 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:40:23,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-28 03:40:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-28 03:40:23,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654869343] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:40:23,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:40:23,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 50 [2024-11-28 03:40:23,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962259866] [2024-11-28 03:40:23,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:40:23,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-28 03:40:23,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:40:23,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-28 03:40:23,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2063, Unknown=3, NotChecked=282, Total=2550 [2024-11-28 03:40:23,454 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 51 states, 50 states have (on average 2.04) internal successors, (102), 51 states have internal predecessors, (102), 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) [2024-11-28 03:40:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:40:25,083 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-11-28 03:40:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 03:40:25,083 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.04) internal successors, (102), 51 states have internal predecessors, (102), 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 39 [2024-11-28 03:40:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:40:25,084 INFO L225 Difference]: With dead ends: 86 [2024-11-28 03:40:25,084 INFO L226 Difference]: Without dead ends: 86 [2024-11-28 03:40:25,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=403, Invalid=3512, Unknown=3, NotChecked=372, Total=4290 [2024-11-28 03:40:25,086 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 145 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:40:25,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 843 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1292 Invalid, 0 Unknown, 192 Unchecked, 0.9s Time] [2024-11-28 03:40:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-28 03:40:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-11-28 03:40:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 81 states have internal predecessors, (87), 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) [2024-11-28 03:40:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-28 03:40:25,089 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 39 [2024-11-28 03:40:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:40:25,089 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-28 03:40:25,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.04) internal successors, (102), 51 states have internal predecessors, (102), 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) [2024-11-28 03:40:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-28 03:40:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 03:40:25,090 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:40:25,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:40:25,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 03:40:25,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 03:40:25,291 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:40:25,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:40:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash -846107327, now seen corresponding path program 1 times [2024-11-28 03:40:25,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:40:25,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886499117] [2024-11-28 03:40:25,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:25,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:40:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:40:26,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886499117] [2024-11-28 03:40:26,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886499117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:40:26,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651758501] [2024-11-28 03:40:26,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:26,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:40:26,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:40:26,440 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:40:26,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 03:40:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:26,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 03:40:26,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:40:26,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:40:26,684 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:40:26,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:40:26,825 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 03:40:26,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 03:40:26,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-28 03:40:26,925 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:40:26,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-28 03:40:27,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 03:40:27,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-28 03:40:27,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:40:27,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:27,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-28 03:40:28,092 INFO L349 Elim1Store]: treesize reduction 48, result has 63.9 percent of original size [2024-11-28 03:40:28,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 170 [2024-11-28 03:40:34,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:40:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:34,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:40:35,669 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1570 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1570) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1572 Int) (v_ArrVal_1570 (Array Int Int))) (= (let ((.cse1 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1570) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store |c_#valid| (select .cse1 4) v_ArrVal_1572) (select .cse1 0))) 1)))) is different from false [2024-11-28 03:40:35,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:35,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 124 [2024-11-28 03:40:35,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:35,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-28 03:40:35,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2024-11-28 03:40:35,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2024-11-28 03:40:36,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:36,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2024-11-28 03:40:36,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2024-11-28 03:40:36,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:36,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2024-11-28 03:40:36,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109 [2024-11-28 03:40:36,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 164 [2024-11-28 03:40:36,089 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:36,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:36,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 182 [2024-11-28 03:40:36,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 183 [2024-11-28 03:40:36,159 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 03:40:36,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2024-11-28 03:40:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-28 03:40:36,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651758501] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:40:36,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:40:36,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 56 [2024-11-28 03:40:36,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372111852] [2024-11-28 03:40:36,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:40:36,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-28 03:40:36,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:40:36,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-28 03:40:36,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2860, Unknown=22, NotChecked=108, Total=3192 [2024-11-28 03:40:36,732 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 57 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 57 states have internal predecessors, (104), 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) [2024-11-28 03:40:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:40:38,986 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-28 03:40:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 03:40:38,986 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 57 states have internal predecessors, (104), 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 39 [2024-11-28 03:40:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:40:38,987 INFO L225 Difference]: With dead ends: 85 [2024-11-28 03:40:38,987 INFO L226 Difference]: Without dead ends: 85 [2024-11-28 03:40:38,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=483, Invalid=5350, Unknown=23, NotChecked=150, Total=6006 [2024-11-28 03:40:38,988 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 108 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:40:38,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 799 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1315 Invalid, 0 Unknown, 71 Unchecked, 1.0s Time] [2024-11-28 03:40:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-28 03:40:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-28 03:40:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 80 states have internal predecessors, (86), 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) [2024-11-28 03:40:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-11-28 03:40:38,991 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 39 [2024-11-28 03:40:38,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:40:38,991 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-11-28 03:40:38,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 57 states have internal predecessors, (104), 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) [2024-11-28 03:40:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-11-28 03:40:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 03:40:38,991 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:40:38,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:40:39,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 03:40:39,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 03:40:39,192 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:40:39,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:40:39,192 INFO L85 PathProgramCache]: Analyzing trace with hash -436949797, now seen corresponding path program 1 times [2024-11-28 03:40:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:40:39,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358138063] [2024-11-28 03:40:39,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:39,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:40:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:40,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:40:40,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358138063] [2024-11-28 03:40:40,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358138063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:40:40,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780937852] [2024-11-28 03:40:40,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:40,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:40:40,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:40:40,310 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:40:40,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 03:40:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:40,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 03:40:40,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:40:40,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:40:40,565 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:40:40,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:40:40,707 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 03:40:40,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 03:40:40,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-28 03:40:40,810 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:40:40,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-28 03:40:40,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-28 03:40:40,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-28 03:40:41,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:40:41,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:41,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-28 03:40:41,779 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-28 03:40:41,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 88 [2024-11-28 03:40:42,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:40:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:42,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:40:42,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:42,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 106 [2024-11-28 03:40:42,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (v_prenex_12 (Array Int Int))) (not (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1658) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 0) (select .cse0 4))))) (forall ((v_ArrVal_1658 (Array Int Int)) (v_prenex_12 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1658) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (forall ((v_ArrVal_1659 (Array Int Int)) (v_ArrVal_1658 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1658) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1659) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-28 03:40:42,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:42,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2024-11-28 03:40:42,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 221 [2024-11-28 03:40:43,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:43,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 154 [2024-11-28 03:40:43,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 151 [2024-11-28 03:40:43,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 192 [2024-11-28 03:40:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-28 03:40:43,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780937852] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:40:43,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:40:43,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 57 [2024-11-28 03:40:43,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710024379] [2024-11-28 03:40:43,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:40:43,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 03:40:43,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:40:43,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 03:40:43,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2918, Unknown=1, NotChecked=110, Total=3306 [2024-11-28 03:40:43,550 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 58 states, 57 states have (on average 1.8245614035087718) internal successors, (104), 58 states have internal predecessors, (104), 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) [2024-11-28 03:40:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:40:45,020 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-28 03:40:45,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 03:40:45,020 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.8245614035087718) internal successors, (104), 58 states have internal predecessors, (104), 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 39 [2024-11-28 03:40:45,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:40:45,021 INFO L225 Difference]: With dead ends: 84 [2024-11-28 03:40:45,021 INFO L226 Difference]: Without dead ends: 84 [2024-11-28 03:40:45,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1583 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=476, Invalid=4219, Unknown=1, NotChecked=134, Total=4830 [2024-11-28 03:40:45,022 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 122 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:40:45,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 759 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1041 Invalid, 0 Unknown, 61 Unchecked, 0.8s Time] [2024-11-28 03:40:45,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-28 03:40:45,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-11-28 03:40:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 79 states have internal predecessors, (85), 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) [2024-11-28 03:40:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-28 03:40:45,027 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 39 [2024-11-28 03:40:45,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:40:45,027 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-28 03:40:45,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.8245614035087718) internal successors, (104), 58 states have internal predecessors, (104), 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) [2024-11-28 03:40:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-28 03:40:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 03:40:45,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:40:45,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:40:45,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 03:40:45,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:40:45,228 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-28 03:40:45,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:40:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash -48393039, now seen corresponding path program 1 times [2024-11-28 03:40:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:40:45,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010788654] [2024-11-28 03:40:45,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:45,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:40:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:46,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:40:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010788654] [2024-11-28 03:40:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010788654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:40:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652597369] [2024-11-28 03:40:46,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:46,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:40:46,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:40:46,785 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:40:46,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4e0584-899f-417c-a3aa-4e16df1d5ed8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 03:40:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:46,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 03:40:46,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:40:47,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:40:47,559 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:40:47,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-11-28 03:40:47,767 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 03:40:47,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 45 [2024-11-28 03:40:47,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 53 [2024-11-28 03:40:48,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:40:48,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:48,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 69 [2024-11-28 03:40:50,034 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_55| Int) (|v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_55| Int) (|v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_49| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_55| 1))) (and (= (select .cse0 |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_55|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_49| 0) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_55| 0) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_55| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_55|) 0) (= (select (store .cse0 |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_55| 1) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_49|) 0)))) is different from true [2024-11-28 03:40:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:40:50,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:40:50,933 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1752 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1752) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 4) 0) (select .cse0 0) 0)))) is different from false [2024-11-28 03:40:50,950 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1752 (Array Int Int))) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1752) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 4) 0) (select .cse0 0) 0)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-28 03:40:50,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1751 (Array Int Int))) (= (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1751) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1752) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 4) 0) (select .cse0 0) 0)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-28 03:40:50,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:50,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 55 [2024-11-28 03:40:50,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2024-11-28 03:40:50,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 280 [2024-11-28 03:40:51,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:51,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 203 [2024-11-28 03:40:51,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 181 [2024-11-28 03:40:58,323 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse57 (not .cse0)) (.cse5 (= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) 0)) (.cse40 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse13 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (let ((.cse100 (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)))) (.cse56 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)))) (.cse83 (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse261 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse262 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse261 (select (store .cse262 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse261 (select (store .cse262 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)))))) (.cse102 (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse52 (not .cse40)) (.cse9 (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse11 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse10 (not .cse5)) (.cse6 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse49 (or (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse260 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse260 (select .cse2 v_antiDerIndex_entry0_1)) (= .cse260 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) .cse57)) (.cse243 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (and (or (and (or .cse0 (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse1 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse3 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse1 (select (store .cse2 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store .cse3 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse5) (or .cse6 (and (or .cse0 (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse7 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse8 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse7 (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse7 (select (store .cse8 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse9 .cse10) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))) .cse5)) .cse11) (or (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse2 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))) .cse0 .cse5))) (or (and (or .cse0 (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse12 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse12 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse12 (select (store .cse2 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse12 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))) (or .cse0 (and (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse14 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse14 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse15 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse14 (select (store .cse15 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse14 (select (store .cse15 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse14 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse16 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse16 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (= .cse16 (select (store (store .cse4 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))) (= .cse16 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))) .cse11)) .cse5) (or (and (or .cse0 (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse17 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse17 (select (store .cse2 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse17 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))) (or .cse0 (and (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse18 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse19 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse18 (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse18 (select (store .cse19 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse18 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse20 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (= .cse20 (select (store (store .cse4 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))) (= .cse20 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))) .cse11)) .cse5) (or (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse21 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse22 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse21 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse21 (select (store .cse2 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse21 (select (store .cse22 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse21 (select (store .cse22 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse0 .cse5) (or .cse0 (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse23 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse24 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse23 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse23 (select (store .cse24 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse23 (select (store .cse24 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse10) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse26 (store .cse4 v_arrayElimCell_285 0)) (.cse25 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse25 (select (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse25 (select (store .cse26 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse25 (select (store (store .cse4 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse5) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse27 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse28 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse27 (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse29 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse27 (select (store .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse27 (select (store .cse29 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse27 (select (store .cse28 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))) .cse11) (or .cse0 (and (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse30 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse30 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (= .cse30 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse31 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse31 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse32 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse31 (select (store .cse32 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse31 (select (store .cse32 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))))) .cse10) (or .cse0 (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse33 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse34 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse33 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse33 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse33 (select (store .cse34 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse33 (select (store .cse34 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse10) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse35 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse36 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse35 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse35 (select (store .cse36 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse37 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse35 (select (store .cse37 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse35 (select (store .cse37 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse35 (select (store .cse36 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse39 (store .cse4 v_arrayElimCell_285 0)) (.cse38 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse38 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse38 (select (store .cse39 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse38 (select (store .cse39 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse38 (select (store (store .cse4 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse5)) .cse11)) .cse40) (or .cse40 (and (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse41 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse41 (select .cse2 v_antiDerIndex_entry0_1)) (= .cse41 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse41 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (= .cse41 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse42 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse42 (select .cse2 v_antiDerIndex_entry0_1)) (= .cse42 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (or (= .cse42 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse42 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse43 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse43 (select .cse2 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (= .cse43 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse43 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (or .cse0 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse44 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse44 (select .cse2 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (= .cse44 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse45 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse45 (select .cse2 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse45 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (= .cse45 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse2 v_antiDerIndex_entry0_1))) .cse6) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse46 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse46 (select .cse2 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (or (= .cse46 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse46 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse47 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse47 (select .cse2 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse48 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse47 (select (store .cse48 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse48 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))))) .cse49 (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse50 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse50 (select .cse2 v_antiDerIndex_entry0_1)) (= .cse50 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse51 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse50 (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse50 (select (store .cse51 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))))) .cse5) (or (not .cse6) (and (or .cse52 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse53 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse53 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (or (= .cse53 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse53 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse54 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse54 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse54 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse55 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse54 (select (store .cse55 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse54 (select (store .cse55 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))))) (or .cse56 .cse57) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse58 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_284 Int)) (= .cse58 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse58 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse59 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse59 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse59 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse59 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse60 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse59 (select (store .cse60 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse59 (select (store .cse60 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))))) (or .cse10 (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse61 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse61 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse61 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse61 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse62 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse62 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse62 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (or (= .cse62 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse62 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (or .cse40 (and (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse63 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse63 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (= .cse63 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse63 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse64 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse64 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse64 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse65 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse64 (select (store .cse65 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse64 (select (store .cse65 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))))) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse66 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse66 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse66 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse67 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse66 (select (store .cse67 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store .cse67 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (= .cse66 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse68 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse68 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse68 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) .cse57) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse69 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse69 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse69 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse69 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) .cse52)) .cse5) (or (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse70 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse70 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse70 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) .cse57) (or (and (or (and (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse71 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse72 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse71 (select (store .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse71 (select (store .cse72 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) .cse5)) .cse40) (or (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse73 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse73 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse73 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse5) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse74 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse74 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse75 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse74 (select (store .cse75 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse74 (select (store .cse75 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse10) (or .cse52 (forall ((v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse0) (or .cse52 (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_279 Int)) (let ((.cse76 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse76 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse76 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse76 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse77 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse77 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse77 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse78 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse77 (select (store .cse78 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse77 (select (store .cse78 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse79 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse79 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse79 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse79 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse5)) .cse40) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse80 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse80 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse5) (or (and (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse82 (store .cse4 v_arrayElimCell_280 0)) (.cse81 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse81 (select (store .cse82 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse81 (select (store .cse82 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse81 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse5) (or .cse83 .cse57) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse84 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse85 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse84 (select (store .cse85 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse84 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse84 (select (store .cse85 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) .cse10) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_279 Int)) (let ((.cse87 (store .cse4 v_arrayElimCell_280 0)) (.cse86 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse86 (select (store .cse87 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse86 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse86 (select (store .cse87 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse86 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse5) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse89 (store .cse4 v_arrayElimCell_280 0)) (.cse88 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse88 (select (store .cse89 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse88 (select (store .cse89 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse90 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse88 (select (store .cse90 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse88 (select (store .cse90 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse91 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse92 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse91 (select (store .cse92 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse91 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse93 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse91 (select (store .cse93 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store .cse93 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (= .cse91 (select (store .cse92 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse94 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_284 Int)) (or (= .cse94 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse95 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse94 (select (store .cse95 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse94 (select (store .cse95 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (= .cse94 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse96 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (= .cse96 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse96 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse97 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse97 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (or (= .cse97 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse97 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse98 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse98 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse99 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse98 (select (store .cse99 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse98 (select (store .cse99 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (or .cse100 .cse57)) .cse5)) .cse40) (or (and (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse101 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_285 Int)) (= .cse101 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse101 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse102 .cse57) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse103 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse103 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse104 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse103 (select (store .cse104 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse103 (select (store .cse104 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse105 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse105 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse105 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse106 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse105 (select (store .cse106 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse105 (select (store .cse106 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))))))) .cse10))) (or .cse100 .cse40 .cse57 .cse5) (or (let ((.cse109 (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) (and (or .cse10 (and (or (and (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse107 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_279 Int)) (let ((.cse108 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse107 (select (store .cse108 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse107 (select (store .cse108 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (= .cse107 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse107 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse110 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse110 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse110 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_280 Int)) (= .cse110 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse57) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse113 (store .cse4 v_arrayElimCell_283 0)) (.cse111 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse114 (store .cse4 v_arrayElimCell_285 0))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_279 Int)) (let ((.cse112 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse111 (select (store .cse112 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse112 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (= .cse111 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse113 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse114 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse113 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse114 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse116 (store .cse4 v_arrayElimCell_283 0)) (.cse115 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse117 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse115 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse115 (select (store .cse116 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse115 (select (store .cse117 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_280 Int)) (= .cse115 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse115 (select (store .cse116 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse115 (select (store .cse117 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse118 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse120 (store .cse4 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_279 Int)) (let ((.cse119 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse118 (select (store .cse119 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse119 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (= .cse118 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse120 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse120 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse121 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse122 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse121 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse121 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse121 (select (store .cse122 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse121 (select (store .cse122 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse6) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse123 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse124 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse123 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse123 (select (store .cse124 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse123 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_280 Int)) (= .cse123 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse123 (select (store .cse124 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse126 (store .cse4 v_arrayElimCell_283 0)) (.cse125 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse127 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse125 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse125 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse125 (select (store .cse126 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse125 (select (store .cse127 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_280 Int)) (= .cse125 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse125 (select (store .cse126 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse125 (select (store .cse127 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse130 (store .cse4 v_arrayElimCell_283 0)) (.cse128 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse131 (store .cse4 v_arrayElimCell_285 0))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_279 Int)) (let ((.cse129 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse128 (select (store .cse129 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store .cse129 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (= .cse128 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse128 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse128 (select (store .cse130 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store .cse131 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store .cse130 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store .cse131 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (or (and (or .cse52 (and (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse132 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse132 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse132 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (= .cse132 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse132 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse133 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse133 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse57) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse134 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_284 Int)) (= .cse134 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse134 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse134 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse134 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse135 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse135 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse135 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse135 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse135 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (= .cse135 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))))) (or .cse52 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse136 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse136 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse136 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (= .cse136 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse137 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse137 (select .cse109 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse137 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse138 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse137 (select (store .cse138 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse137 (select (store .cse138 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse109 v_antiDerIndex_entry0_1))) .cse6) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse139 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse139 (select .cse109 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (or (= .cse139 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse140 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_284 Int)) (= .cse140 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse140 (select .cse109 v_antiDerIndex_entry0_1)))))) .cse0) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse141 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse141 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse141 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) .cse57) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse142 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse142 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse142 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse142 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (= .cse142 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse143 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_284 Int)) (= .cse143 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse143 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse143 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))))) (or .cse0 (and (or .cse6 (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse144 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse144 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse144 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse40 (and (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse145 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse145 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse145 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse146 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse145 (select (store .cse146 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse145 (select (store .cse146 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse147 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse147 (select .cse109 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (= .cse147 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse147 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse148 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse148 (select .cse109 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse148 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse149 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse148 (select (store .cse149 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse149 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (= .cse148 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse150 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse150 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse150 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (or (= .cse150 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse151 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse151 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse151 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse151 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse52)))) .cse5) (or (and (or .cse52 .cse56) (or .cse10 (and .cse83 .cse102))) .cse57) (or .cse0 (and (or (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse152 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse153 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse152 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse152 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse152 (select (store .cse153 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse152 (select (store .cse153 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse52) (or .cse40 (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse155 (store .cse4 v_arrayElimCell_283 0)) (.cse154 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse154 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse154 (select (store .cse155 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse154 (select (store .cse155 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse154 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse5) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse157 (store .cse4 v_arrayElimCell_283 0)) (.cse156 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse156 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse156 (select (store .cse157 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse156 (select (store .cse157 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse158 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse156 (select (store .cse158 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse156 (select (store .cse158 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse159 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse160 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse159 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse159 (select (store .cse160 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store .cse160 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse161 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse162 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse161 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse161 (select (store .cse162 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse161 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse163 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse161 (select (store .cse163 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse161 (select (store .cse163 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (= .cse161 (select (store .cse162 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse164 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse165 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse164 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse164 (select (store .cse165 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse164 (select (store .cse165 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse6) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse167 (store .cse4 v_arrayElimCell_283 0)) (.cse166 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse166 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse166 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse166 (select (store .cse167 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse166 (select (store .cse167 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse166 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse5))) (or .cse52 (and (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse168 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse169 (store .cse4 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_284 Int)) (= .cse168 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse168 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse168 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse168 (select (store .cse169 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse168 (select (store .cse169 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse170 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse171 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse170 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse170 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse170 (select (store .cse171 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (= .cse170 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse170 (select (store .cse171 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse172 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse172 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse172 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse172 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse57) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse174 (store .cse4 v_arrayElimCell_283 0)) (.cse173 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse173 (select .cse109 v_antiDerIndex_entry0_1)) (= .cse173 (select (store .cse13 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (= .cse173 (select (store .cse174 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse173 (select (store .cse174 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse173 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (= .cse173 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))))) (or (and (or .cse0 (and (or (and (or (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse6) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse175 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_284 Int)) (or (= .cse175 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse176 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse175 (select (store .cse176 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse175 (select (store .cse176 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (= .cse175 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse177 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (= .cse177 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse177 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse178 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse178 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse179 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse178 (select (store .cse179 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse178 (select (store .cse179 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse180 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse180 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (or (= .cse180 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) .cse5) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse182 (store .cse4 v_arrayElimCell_283 0)) (.cse181 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse181 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store .cse182 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store .cse182 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse5) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse184 (store .cse4 v_arrayElimCell_283 0)) (.cse183 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse183 (select (store .cse184 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store .cse184 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse185 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse183 (select (store .cse185 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store .cse185 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (or .cse10 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse186 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse187 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse186 (select (store .cse187 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store .cse187 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse6 (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse188 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse189 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse188 (select (store .cse189 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse188 (select (store .cse189 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse191 (store .cse4 v_arrayElimCell_283 0)) (.cse190 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse190 (select (store .cse191 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse191 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse5) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse192 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse193 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse192 (select (store .cse193 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse192 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse194 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse192 (select (store .cse194 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse192 (select (store .cse194 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (= .cse192 (select (store .cse193 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (and (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse195 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse196 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse195 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse195 (select (store .cse196 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse195 (select (store .cse196 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse6) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse198 (store .cse4 v_arrayElimCell_283 0)) (.cse197 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse199 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse197 (select (store .cse198 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse197 (select (store .cse199 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_280 Int)) (= .cse197 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse197 (select (store .cse198 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse197 (select (store .cse199 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse201 (store .cse4 v_arrayElimCell_283 0)) (.cse200 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse202 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse200 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse201 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse202 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_280 Int)) (= .cse200 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse200 (select (store .cse201 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse202 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse203 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse205 (store .cse4 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_279 Int)) (let ((.cse204 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse203 (select (store .cse204 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse204 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (= .cse203 (select (store .cse205 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse205 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse206 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse207 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse206 (select (store .cse207 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse206 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_280 Int)) (= .cse206 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse206 (select (store .cse207 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse210 (store .cse4 v_arrayElimCell_283 0)) (.cse208 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse211 (store .cse4 v_arrayElimCell_285 0))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_279 Int)) (let ((.cse209 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse208 (select (store .cse209 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store .cse209 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (= .cse208 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store .cse210 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store .cse211 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store .cse210 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store .cse211 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse214 (store .cse4 v_arrayElimCell_283 0)) (.cse212 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse215 (store .cse4 v_arrayElimCell_285 0))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_279 Int)) (let ((.cse213 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse212 (select (store .cse213 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse212 (select (store .cse213 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (= .cse212 (select (store .cse214 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse212 (select (store .cse215 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse212 (select (store .cse214 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse212 (select (store .cse215 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse216 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse218 (store .cse4 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_279 Int)) (let ((.cse217 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse216 (select (store .cse217 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse216 (select (store .cse217 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (= .cse216 (select (store .cse218 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse216 (select (store .cse218 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse219 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse220 (store .cse4 v_arrayElimCell_283 0))) (or (= .cse219 (select (store .cse220 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_280 Int)) (= .cse219 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse219 (select (store .cse220 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse57)) .cse10)) .cse40) (or .cse10 (and (or (and (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse221 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse221 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_280 Int)) (= .cse221 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse222 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_279 Int)) (let ((.cse223 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse222 (select (store .cse223 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse222 (select (store .cse223 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (= .cse222 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse57) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse224 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse224 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_280 Int)) (= .cse224 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse225 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse226 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse225 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse225 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse225 (select (store .cse226 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_280 Int)) (= .cse225 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse225 (select (store .cse226 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse227 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse229 (store .cse4 v_arrayElimCell_285 0))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_279 Int)) (let ((.cse228 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse227 (select (store .cse228 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse227 (select (store .cse228 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (= .cse227 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse227 (select (store .cse229 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse227 (select (store .cse229 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (or .cse0 (and (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse230 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_285 Int)) (= .cse230 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse230 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse231 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse231 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse232 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse231 (select (store .cse232 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse231 (select (store .cse232 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (or .cse6 .cse9) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse233 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse233 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse233 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (let ((.cse234 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse233 (select (store .cse234 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse233 (select (store .cse234 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))))))) (or .cse6 (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse235 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse235 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse235 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse236 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_279 Int)) (let ((.cse237 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse236 (select (store .cse237 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse236 (select (store .cse237 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (= .cse236 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse236 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse238 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse240 (store .cse4 v_arrayElimCell_285 0))) (or (forall ((v_arrayElimCell_280 Int) (v_arrayElimCell_279 Int)) (let ((.cse239 (store .cse4 v_arrayElimCell_280 0))) (or (= .cse238 (select (store .cse239 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store .cse239 v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (= .cse238 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store .cse240 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store .cse240 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse241 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse242 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse241 (select (store (store .cse4 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse241 (select (store .cse242 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_280 Int)) (= .cse241 (select (store (store .cse4 v_arrayElimCell_280 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse241 (select (store .cse242 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))))) .cse11) (or (and (or .cse10 (and (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse243 v_antiDerIndex_entry0_1)))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse244 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse244 (select .cse243 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse245 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse244 (select (store .cse245 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse244 (select (store .cse245 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse246 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_285 Int)) (= .cse246 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse246 (select .cse243 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse247 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse247 (select .cse243 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse247 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (= .cse247 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))))) (or .cse40 (and (or (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse248 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse248 (select .cse2 v_antiDerIndex_entry0_1)) (= .cse248 (select (store (store .cse4 v_arrayElimCell_285 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse249 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse249 (select .cse243 v_antiDerIndex_entry0_1)) (= .cse249 (select .cse2 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse250 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse249 (select (store .cse250 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse249 (select (store .cse250 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse251 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse251 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse251 (select .cse2 v_antiDerIndex_entry0_1)) (= .cse251 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse5) (or (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse252 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse252 (select .cse243 v_antiDerIndex_entry0_1)) (= .cse252 (select .cse2 v_antiDerIndex_entry0_1))))) .cse6) (or (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse253 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse253 (select .cse243 v_antiDerIndex_entry0_1)) (= .cse253 (select .cse2 v_antiDerIndex_entry0_1)) (= .cse253 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))) .cse5) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse254 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse254 (select .cse243 v_antiDerIndex_entry0_1)) (= .cse254 (select .cse2 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse254 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (= .cse254 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))))))) .cse0) (or .cse40 (and (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse255 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse255 (select .cse243 v_antiDerIndex_entry0_1)) (= .cse255 (select .cse2 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (= .cse255 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))) (= .cse255 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse256 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse256 (select .cse243 v_antiDerIndex_entry0_1)) (= .cse256 (select .cse2 v_antiDerIndex_entry0_1)) (= .cse256 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (let ((.cse257 (store .cse4 v_arrayElimCell_285 0))) (or (= .cse256 (select (store .cse257 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse256 (select (store .cse257 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)))))))) .cse49 (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse258 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse258 (select .cse243 v_antiDerIndex_entry0_1)) (= .cse258 (select .cse2 v_antiDerIndex_entry0_1)) (= .cse258 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int)) (or (= .cse258 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (= .cse258 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_280 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_279 Int)) (let ((.cse259 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse259 (select .cse243 v_antiDerIndex_entry0_1)) (= .cse259 (select .cse2 v_antiDerIndex_entry0_1)) (= .cse259 (select (store (store .cse4 v_arrayElimCell_280 0) v_arrayElimCell_279 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (or (= .cse259 (select (store .cse13 v_arrayElimCell_284 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_285 Int)) (= .cse259 (select (store (store .cse4 v_arrayElimCell_285 0) v_arrayElimCell_284 0) v_antiDerIndex_entry0_1))))))))) .cse5))))) is different from false [2024-11-28 03:45:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-28 03:45:23,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652597369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:45:23,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:45:23,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 22] total 62 [2024-11-28 03:45:23,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926441774] [2024-11-28 03:45:23,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:45:23,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-28 03:45:23,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:45:23,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-28 03:45:23,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3125, Unknown=16, NotChecked=580, Total=3906 [2024-11-28 03:45:23,547 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 63 states, 62 states have (on average 1.8225806451612903) internal successors, (113), 63 states have internal predecessors, (113), 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) [2024-11-28 03:45:30,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:31,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:33,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:35,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:38,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:40,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:41,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:43,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:44,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:46,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:47,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:51,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:53,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:45:55,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:46:11,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:46:15,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:46:17,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:46:21,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:46:22,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:46:25,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:46:28,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:46:32,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:46:34,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:46:45,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:46:49,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:46:52,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:47:03,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:47:05,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:47:09,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:47:13,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:47:38,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:47:40,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:47:43,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:47:47,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:47:51,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:14,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:17,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:19,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:22,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:24,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:27,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:29,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:31,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:33,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:45,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:47,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:49,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:52,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:48:56,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:49:12,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:49:14,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:49:16,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:49:19,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:49:21,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:49:48,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:49:50,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:49:51,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:49:54,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:49:56,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:49:58,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:00,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:02,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:04,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:06,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:09,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:11,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:13,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:15,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:34,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:38,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:40,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:43,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:50:47,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:51:04,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:51:05,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:51:08,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:51:11,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:51:13,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:51:31,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:51:33,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:51:35,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:51:39,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:51:41,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:51:57,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:52:00,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:52:03,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:52:07,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:52:09,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:52:28,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:52:29,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:52:33,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:52:35,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:52:37,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:52:56,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:52:58,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:01,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:03,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:07,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:25,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:27,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:29,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:33,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:36,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:40,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:43,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]