./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.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_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/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_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/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_854cf018-a55d-493a-95e3-a2e7946899a3/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 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:47:41,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:47:42,083 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:47:42,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:47:42,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:47:42,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:47:42,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:47:42,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:47:42,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:47:42,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:47:42,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:47:42,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:47:42,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:47:42,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:47:42,129 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:47:42,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:47:42,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:47:42,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:47:42,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:47:42,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:47:42,129 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:47:42,129 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:47:42,130 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:47:42,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:47:42,130 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:47:42,130 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:47:42,130 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:47:42,130 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:47:42,130 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:47:42,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:47:42,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:47:42,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:47:42,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:47:42,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:47:42,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:47:42,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:47:42,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:47:42,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:47:42,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:47:42,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:47:42,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:47:42,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:47:42,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:47:42,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:47:42,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:47:42,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:47:42,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:47:42,133 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_854cf018-a55d-493a-95e3-a2e7946899a3/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 -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2024-11-28 03:47:42,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:47:42,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:47:42,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:47:42,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:47:42,496 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:47:42,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-28 03:47:45,600 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/data/31a93796f/6286ecb02e8348b3b167678312f6bd9c/FLAG496faa2f7 [2024-11-28 03:47:45,941 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:47:45,942 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-28 03:47:45,960 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/data/31a93796f/6286ecb02e8348b3b167678312f6bd9c/FLAG496faa2f7 [2024-11-28 03:47:45,982 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/data/31a93796f/6286ecb02e8348b3b167678312f6bd9c [2024-11-28 03:47:45,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:47:45,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:47:45,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:47:45,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:47:45,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:47:45,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:47:45" (1/1) ... [2024-11-28 03:47:45,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a093516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:45, skipping insertion in model container [2024-11-28 03:47:45,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:47:45" (1/1) ... [2024-11-28 03:47:46,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:47:46,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:47:46,489 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:47:46,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:47:46,586 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:47:46,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46 WrapperNode [2024-11-28 03:47:46,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:47:46,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:47:46,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:47:46,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:47:46,607 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:47:46" (1/1) ... [2024-11-28 03:47:46,629 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:47:46" (1/1) ... [2024-11-28 03:47:46,656 INFO L138 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-11-28 03:47:46,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:47:46,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:47:46,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:47:46,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:47:46,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46" (1/1) ... [2024-11-28 03:47:46,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46" (1/1) ... [2024-11-28 03:47:46,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46" (1/1) ... [2024-11-28 03:47:46,707 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2024-11-28 03:47:46,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46" (1/1) ... [2024-11-28 03:47:46,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46" (1/1) ... [2024-11-28 03:47:46,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46" (1/1) ... [2024-11-28 03:47:46,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46" (1/1) ... [2024-11-28 03:47:46,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46" (1/1) ... [2024-11-28 03:47:46,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46" (1/1) ... [2024-11-28 03:47:46,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46" (1/1) ... [2024-11-28 03:47:46,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:47:46,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:47:46,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:47:46,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:47:46,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46" (1/1) ... [2024-11-28 03:47:46,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:47:46,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:47:46,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/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:47:46,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/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:47:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-28 03:47:46,838 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-28 03:47:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:47:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:47:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:47:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:47:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:47:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:47:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:47:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:47:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:47:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:47:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:47:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:47:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:47:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:47:46,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:47:47,006 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:47:47,008 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:47:47,051 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-28 03:47:47,464 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-28 03:47:47,464 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:47:47,485 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:47:47,485 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 03:47:47,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:47:47 BoogieIcfgContainer [2024-11-28 03:47:47,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:47:47,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:47:47,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:47:47,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:47:47,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:47:45" (1/3) ... [2024-11-28 03:47:47,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4e382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:47:47, skipping insertion in model container [2024-11-28 03:47:47,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:47:46" (2/3) ... [2024-11-28 03:47:47,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4e382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:47:47, skipping insertion in model container [2024-11-28 03:47:47,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:47:47" (3/3) ... [2024-11-28 03:47:47,498 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2024-11-28 03:47:47,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:47:47,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_circular_traversal-2.i that has 2 procedures, 85 locations, 1 initial locations, 3 loop locations, and 35 error locations. [2024-11-28 03:47:47,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:47:47,561 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;@5eacb3f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:47:47,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-28 03:47:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 46 states have (on average 2.0) internal successors, (92), 82 states have internal predecessors, (92), 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:47:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 03:47:47,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:47,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 03:47:47,571 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:47,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:47,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-28 03:47:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771989784] [2024-11-28 03:47:47,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:47,859 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:47:47,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:47,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771989784] [2024-11-28 03:47:47,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771989784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:47:47,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:47:47,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:47:47,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425413252] [2024-11-28 03:47:47,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:47:47,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:47:47,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:47,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:47:47,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:47:47,901 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 2.0) internal successors, (92), 82 states have internal predecessors, (92), 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:47:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:48,060 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2024-11-28 03:47:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:47:48,063 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:47:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:48,069 INFO L225 Difference]: With dead ends: 79 [2024-11-28 03:47:48,069 INFO L226 Difference]: Without dead ends: 73 [2024-11-28 03:47:48,072 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:47:48,074 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:47:48,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 96 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:47:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-28 03:47:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-28 03:47:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 72 states have internal predecessors, (76), 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:47:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-11-28 03:47:48,126 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 4 [2024-11-28 03:47:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:48,127 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-11-28 03:47:48,127 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:47:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-11-28 03:47:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 03:47:48,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:48,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 03:47:48,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:47:48,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:48,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-28 03:47:48,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:48,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769048745] [2024-11-28 03:47:48,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:48,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:48,287 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:47:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769048745] [2024-11-28 03:47:48,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769048745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:47:48,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:47:48,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:47:48,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980097986] [2024-11-28 03:47:48,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:47:48,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:47:48,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:48,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:47:48,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:47:48,290 INFO L87 Difference]: Start difference. First operand 73 states and 76 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:47:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:48,393 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-28 03:47:48,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:47:48,396 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:47:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:48,397 INFO L225 Difference]: With dead ends: 69 [2024-11-28 03:47:48,397 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 03:47:48,397 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:47:48,398 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:47:48,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:47:48,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 03:47:48,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-28 03:47:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 68 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:47:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-28 03:47:48,408 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 4 [2024-11-28 03:47:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:48,408 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-28 03:47:48,408 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:47:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-28 03:47:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 03:47:48,409 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:48,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:47:48,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:47:48,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:48,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:48,410 INFO L85 PathProgramCache]: Analyzing trace with hash -401980876, now seen corresponding path program 1 times [2024-11-28 03:47:48,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:48,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167958576] [2024-11-28 03:47:48,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:48,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:48,633 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:47:48,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:48,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167958576] [2024-11-28 03:47:48,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167958576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:47:48,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:47:48,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:47:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950865605] [2024-11-28 03:47:48,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:47:48,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:47:48,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:48,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:47:48,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:47:48,635 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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:47:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:48,665 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-28 03:47:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:47:48,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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:47:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:48,668 INFO L225 Difference]: With dead ends: 82 [2024-11-28 03:47:48,668 INFO L226 Difference]: Without dead ends: 82 [2024-11-28 03:47:48,668 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:47:48,669 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 132 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:47:48,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:47:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-28 03:47:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2024-11-28 03:47:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.697674418604651) internal successors, (73), 69 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:47:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-11-28 03:47:48,677 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 10 [2024-11-28 03:47:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:48,678 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-11-28 03:47:48,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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:47:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-11-28 03:47:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:47:48,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:48,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:47:48,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:47:48,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:48,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash 423414423, now seen corresponding path program 1 times [2024-11-28 03:47:48,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:48,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668720283] [2024-11-28 03:47:48,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:48,824 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:47:48,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:48,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668720283] [2024-11-28 03:47:48,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668720283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:47:48,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:47:48,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:47:48,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188563926] [2024-11-28 03:47:48,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:47:48,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:47:48,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:48,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:47:48,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:47:48,825 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:47:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:48,917 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-11-28 03:47:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:47:48,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:47:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:48,919 INFO L225 Difference]: With dead ends: 68 [2024-11-28 03:47:48,919 INFO L226 Difference]: Without dead ends: 68 [2024-11-28 03:47:48,919 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:47:48,920 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:47:48,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 96 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:47:48,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-28 03:47:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-28 03:47:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 67 states have internal predecessors, (71), 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:47:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-11-28 03:47:48,931 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 11 [2024-11-28 03:47:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:48,931 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-11-28 03:47:48,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:47:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-11-28 03:47:48,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:47:48,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:48,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:47:48,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:47:48,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:48,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash 423414424, now seen corresponding path program 1 times [2024-11-28 03:47:48,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:48,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133533892] [2024-11-28 03:47:48,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:49,135 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:47:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133533892] [2024-11-28 03:47:49,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133533892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:47:49,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:47:49,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:47:49,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560149996] [2024-11-28 03:47:49,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:47:49,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:47:49,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:49,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:47:49,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:47:49,137 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:47:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:49,219 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2024-11-28 03:47:49,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:47:49,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:47:49,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:49,224 INFO L225 Difference]: With dead ends: 66 [2024-11-28 03:47:49,225 INFO L226 Difference]: Without dead ends: 66 [2024-11-28 03:47:49,225 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:47:49,225 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:47:49,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 99 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:47:49,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-28 03:47:49,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-28 03:47:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 65 states have internal predecessors, (69), 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:47:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-11-28 03:47:49,235 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 11 [2024-11-28 03:47:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:49,235 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-11-28 03:47:49,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:47:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-11-28 03:47:49,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 03:47:49,236 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:49,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:47:49,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:47:49,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:49,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1120632134, now seen corresponding path program 1 times [2024-11-28 03:47:49,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:49,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144956501] [2024-11-28 03:47:49,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:49,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:49,477 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:47:49,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:49,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144956501] [2024-11-28 03:47:49,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144956501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:47:49,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:47:49,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:47:49,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049461597] [2024-11-28 03:47:49,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:47:49,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:47:49,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:49,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:47:49,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:47:49,479 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:47:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:49,628 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-28 03:47:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:47:49,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2024-11-28 03:47:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:49,629 INFO L225 Difference]: With dead ends: 71 [2024-11-28 03:47:49,631 INFO L226 Difference]: Without dead ends: 71 [2024-11-28 03:47:49,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:47:49,632 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 20 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:47:49,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 142 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:47:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-28 03:47:49,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-28 03:47:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.5625) internal successors, (75), 70 states have internal predecessors, (75), 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:47:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-28 03:47:49,642 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 13 [2024-11-28 03:47:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:49,643 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-28 03:47:49,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:47:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-28 03:47:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 03:47:49,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:49,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:47:49,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:47:49,644 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:49,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1120632133, now seen corresponding path program 1 times [2024-11-28 03:47:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285164066] [2024-11-28 03:47:49,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:49,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:49,943 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:47:49,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:49,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285164066] [2024-11-28 03:47:49,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285164066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:47:49,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:47:49,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:47:49,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091724271] [2024-11-28 03:47:49,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:47:49,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:47:49,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:49,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:47:49,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:47:49,947 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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:47:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:50,091 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-28 03:47:50,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:47:50,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2024-11-28 03:47:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:50,092 INFO L225 Difference]: With dead ends: 71 [2024-11-28 03:47:50,093 INFO L226 Difference]: Without dead ends: 71 [2024-11-28 03:47:50,093 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:47:50,094 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 40 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:47:50,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 119 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:47:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-28 03:47:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-28 03:47:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 70 states have internal predecessors, (74), 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:47:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-28 03:47:50,099 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 13 [2024-11-28 03:47:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:50,100 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-28 03:47:50,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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:47:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-28 03:47:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 03:47:50,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:50,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:47:50,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:47:50,101 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:50,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:50,102 INFO L85 PathProgramCache]: Analyzing trace with hash 896150570, now seen corresponding path program 1 times [2024-11-28 03:47:50,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:50,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668668012] [2024-11-28 03:47:50,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:50,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:47:50,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:50,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668668012] [2024-11-28 03:47:50,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668668012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:47:50,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:47:50,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:47:50,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289188647] [2024-11-28 03:47:50,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:47:50,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:47:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:50,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:47:50,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:47:50,204 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:47:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:50,351 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-28 03:47:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:47:50,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-28 03:47:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:50,352 INFO L225 Difference]: With dead ends: 69 [2024-11-28 03:47:50,352 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 03:47:50,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:47:50,353 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:47:50,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:47:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 03:47:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-28 03:47:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.5) internal successors, (72), 68 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:47:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-28 03:47:50,359 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 17 [2024-11-28 03:47:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:50,359 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-28 03:47:50,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:47:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-28 03:47:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 03:47:50,359 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:50,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:47:50,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:47:50,360 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:50,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash 896150571, now seen corresponding path program 1 times [2024-11-28 03:47:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:50,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484647203] [2024-11-28 03:47:50,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:50,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:50,473 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:47:50,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:50,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484647203] [2024-11-28 03:47:50,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484647203] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:47:50,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970450588] [2024-11-28 03:47:50,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:50,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:47:50,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:47:50,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:47:50,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:47:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:50,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:47:50,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:47:50,754 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:47:50,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:47:50,814 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:47:50,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970450588] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:47:50,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:47:50,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-28 03:47:50,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872703462] [2024-11-28 03:47:50,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:47:50,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:47:50,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:50,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:47:50,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:47:50,817 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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:47:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:50,853 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-28 03:47:50,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:47:50,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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 17 [2024-11-28 03:47:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:50,856 INFO L225 Difference]: With dead ends: 87 [2024-11-28 03:47:50,857 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 03:47:50,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:47:50,858 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 15 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:47:50,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 232 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:47:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 03:47:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-28 03:47:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.40625) 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:47:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-28 03:47:50,870 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 17 [2024-11-28 03:47:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:50,871 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-28 03:47:50,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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:47:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-28 03:47:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:47:50,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:50,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:47:50,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:47:51,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:47:51,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:51,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:51,073 INFO L85 PathProgramCache]: Analyzing trace with hash -372257531, now seen corresponding path program 1 times [2024-11-28 03:47:51,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:51,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025949759] [2024-11-28 03:47:51,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:47:51,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:51,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025949759] [2024-11-28 03:47:51,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025949759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:47:51,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348382495] [2024-11-28 03:47:51,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:51,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:47:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:47:51,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:47:51,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:47:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:51,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 03:47:51,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:47:51,603 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:47:51,730 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 03:47:51,730 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:47:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:47:51,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:47:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:47:52,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348382495] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:47:52,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:47:52,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-11-28 03:47:52,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483747652] [2024-11-28 03:47:52,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:47:52,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:47:52,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:52,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:47:52,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:47:52,032 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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:47:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:52,179 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-28 03:47:52,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:47:52,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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 20 [2024-11-28 03:47:52,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:52,181 INFO L225 Difference]: With dead ends: 83 [2024-11-28 03:47:52,181 INFO L226 Difference]: Without dead ends: 83 [2024-11-28 03:47:52,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 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:47:52,182 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:47:52,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 159 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:47:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-28 03:47:52,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-28 03:47:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.34375) internal successors, (86), 82 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:47:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2024-11-28 03:47:52,188 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 20 [2024-11-28 03:47:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:52,188 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-11-28 03:47:52,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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:47:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2024-11-28 03:47:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 03:47:52,189 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:52,190 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:47:52,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:47:52,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 03:47:52,390 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:52,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:52,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1339800399, now seen corresponding path program 1 times [2024-11-28 03:47:52,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:52,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594206089] [2024-11-28 03:47:52,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:52,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-28 03:47:52,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594206089] [2024-11-28 03:47:52,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594206089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:47:52,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:47:52,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:47:52,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131393447] [2024-11-28 03:47:52,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:47:52,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:47:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:52,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:47:52,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:47:52,664 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:47:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:52,886 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-28 03:47:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:47:52,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 41 [2024-11-28 03:47:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:52,888 INFO L225 Difference]: With dead ends: 80 [2024-11-28 03:47:52,888 INFO L226 Difference]: Without dead ends: 80 [2024-11-28 03:47:52,888 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:47:52,891 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:47:52,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 128 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:47:52,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-28 03:47:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-28 03:47:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 79 states have internal predecessors, (84), 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:47:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-28 03:47:52,901 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 41 [2024-11-28 03:47:52,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:52,901 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-28 03:47:52,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:47:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-28 03:47:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 03:47:52,902 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:52,902 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:47:52,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:47:52,903 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:52,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1339800400, now seen corresponding path program 1 times [2024-11-28 03:47:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:52,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320978916] [2024-11-28 03:47:52,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:52,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-28 03:47:53,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:53,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320978916] [2024-11-28 03:47:53,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320978916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:47:53,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:47:53,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:47:53,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667604100] [2024-11-28 03:47:53,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:47:53,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:47:53,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:53,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:47:53,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:47:53,398 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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:47:53,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:53,591 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-28 03:47:53,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:47:53,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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 41 [2024-11-28 03:47:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:53,593 INFO L225 Difference]: With dead ends: 87 [2024-11-28 03:47:53,593 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 03:47:53,593 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:47:53,594 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:47:53,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 194 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:47:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 03:47:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-11-28 03:47:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 82 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:47:53,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-11-28 03:47:53,598 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 41 [2024-11-28 03:47:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:53,599 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-11-28 03:47:53,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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:47:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-11-28 03:47:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 03:47:53,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:53,600 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:47:53,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:47:53,601 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:53,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:53,601 INFO L85 PathProgramCache]: Analyzing trace with hash 972300203, now seen corresponding path program 1 times [2024-11-28 03:47:53,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067593218] [2024-11-28 03:47:53,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:53,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-28 03:47:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:47:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067593218] [2024-11-28 03:47:54,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067593218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:47:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24083541] [2024-11-28 03:47:54,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:54,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:47:54,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:47:54,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:47:54,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:47:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:47:55,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 03:47:55,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:47:55,412 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:47:55,413 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:47:55,679 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-28 03:47:55,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2024-11-28 03:47:56,002 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-28 03:47:56,003 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:47:56,087 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:47:56,153 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:47:56,266 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:47:56,313 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:47:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:47:56,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:47:56,535 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |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:47:56,558 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |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:47:56,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:47:56,575 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:47:56,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:47:56,595 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:47:56,605 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:47:57,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:47:57,811 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 106 treesize of output 124 [2024-11-28 03:47:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-28 03:47:58,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24083541] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:47:58,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:47:58,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 41 [2024-11-28 03:47:58,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389767512] [2024-11-28 03:47:58,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:47:58,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-28 03:47:58,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:47:58,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-28 03:47:58,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1329, Unknown=6, NotChecked=150, Total=1640 [2024-11-28 03:47:58,016 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 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:47:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:47:59,192 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-28 03:47:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:47:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 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 45 [2024-11-28 03:47:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:47:59,194 INFO L225 Difference]: With dead ends: 83 [2024-11-28 03:47:59,194 INFO L226 Difference]: Without dead ends: 83 [2024-11-28 03:47:59,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=365, Invalid=2087, Unknown=6, NotChecked=194, Total=2652 [2024-11-28 03:47:59,197 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:47:59,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 893 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 529 Invalid, 0 Unknown, 62 Unchecked, 0.6s Time] [2024-11-28 03:47:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-28 03:47:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-28 03:47:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 82 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:47:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2024-11-28 03:47:59,202 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 45 [2024-11-28 03:47:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:47:59,202 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-11-28 03:47:59,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 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:47:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2024-11-28 03:47:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 03:47:59,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:47:59,203 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:47:59,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:47:59,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 03:47:59,404 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:47:59,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:47:59,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1919567614, now seen corresponding path program 1 times [2024-11-28 03:47:59,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:47:59,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760294822] [2024-11-28 03:47:59,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:47:59,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:47:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:48:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:48:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:48:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760294822] [2024-11-28 03:48:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760294822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:48:01,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591445133] [2024-11-28 03:48:01,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:48:01,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:48:01,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:48:01,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:48:01,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:48:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:48:01,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-28 03:48:01,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:48:01,590 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:48:01,591 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:48:01,704 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-28 03:48:01,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2024-11-28 03:48:01,899 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-28 03:48:01,900 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:48:01,944 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 13 treesize of output 9 [2024-11-28 03:48:01,994 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 25 treesize of output 13 [2024-11-28 03:48:02,022 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:48:02,023 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 41 [2024-11-28 03:48:02,143 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 30 treesize of output 23 [2024-11-28 03:48:02,173 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 41 treesize of output 19 [2024-11-28 03:48:02,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:48:02,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 32 [2024-11-28 03:48:02,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:48:02,417 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 41 treesize of output 17 [2024-11-28 03:48:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:48:02,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:48:02,661 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1088 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1088) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) 1)) is different from false [2024-11-28 03:48:02,677 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2024-11-28 03:48:02,678 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 24 treesize of output 23 [2024-11-28 03:48:02,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:48:02,856 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 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-28 03:48:02,860 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 70 treesize of output 58 [2024-11-28 03:48:02,867 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 28 treesize of output 24 [2024-11-28 03:48:02,871 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 42 treesize of output 34 [2024-11-28 03:48:03,451 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:48:03,452 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 45 [2024-11-28 03:48:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 37 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-28 03:48:03,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591445133] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:48:03,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:48:03,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 44 [2024-11-28 03:48:03,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177662281] [2024-11-28 03:48:03,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:48:03,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-28 03:48:03,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:48:03,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-28 03:48:03,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1684, Unknown=31, NotChecked=84, Total=1980 [2024-11-28 03:48:03,484 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 45 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 45 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:48:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:48:04,862 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-11-28 03:48:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:48:04,863 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 45 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) Word has length 47 [2024-11-28 03:48:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:48:04,865 INFO L225 Difference]: With dead ends: 87 [2024-11-28 03:48:04,865 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 03:48:04,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=377, Invalid=2565, Unknown=32, NotChecked=106, Total=3080 [2024-11-28 03:48:04,868 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 77 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:48:04,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 418 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 728 Invalid, 0 Unknown, 62 Unchecked, 0.7s Time] [2024-11-28 03:48:04,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 03:48:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-28 03:48:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 86 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:48:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-11-28 03:48:04,874 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 47 [2024-11-28 03:48:04,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:48:04,875 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-11-28 03:48:04,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 45 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:48:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-11-28 03:48:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 03:48:04,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:48:04,876 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:48:04,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:48:05,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:48:05,081 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:48:05,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:48:05,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1919567613, now seen corresponding path program 1 times [2024-11-28 03:48:05,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:48:05,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72423433] [2024-11-28 03:48:05,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:48:05,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:48:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:48:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:48:07,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:48:07,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72423433] [2024-11-28 03:48:07,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72423433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:48:07,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752991229] [2024-11-28 03:48:07,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:48:07,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:48:07,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:48:07,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:48:07,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:48:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:48:07,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-28 03:48:07,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:48:07,513 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 03:48:07,513 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:48:07,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:48:07,605 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 03:48:07,605 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:48:07,785 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:48:07,785 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:48:07,811 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-28 03:48:07,811 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:48:07,878 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:48:07,889 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:48:07,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:48:07,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:48:08,001 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:48:08,002 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 50 treesize of output 45 [2024-11-28 03:48:08,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 03:48:08,178 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 19 treesize of output 18 [2024-11-28 03:48:08,189 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:48:08,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-28 03:48:08,280 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:48:08,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2024-11-28 03:48:08,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-28 03:48:08,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2024-11-28 03:48:08,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:48:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:48:08,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:48:08,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (and (<= 0 .cse0) (forall ((v_ArrVal_1344 (Array Int Int))) (<= (+ .cse0 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))))))) is different from false [2024-11-28 03:48:08,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (and (<= 0 .cse0) (forall ((v_ArrVal_1344 (Array Int Int))) (<= (+ .cse0 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))))) is different from false [2024-11-28 03:48:08,994 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1340 (Array Int Int))) (<= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1340))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (forall ((v_ArrVal_1344 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int))) (<= (+ 4 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1340))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1341) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)))))) is different from false [2024-11-28 03:48:09,053 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1338 (Array Int Int))) (or (not (= v_ArrVal_1338 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1340 (Array Int Int))) (<= 0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1340))) (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (forall ((v_ArrVal_1338 (Array Int Int))) (or (forall ((v_ArrVal_1344 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1339 Int)) (<= (+ (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1340))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1339)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1341) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)))) (not (= v_ArrVal_1338 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) is different from false [2024-11-28 03:48:09,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:48:09,090 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 2 case distinctions, treesize of input 60 treesize of output 66 [2024-11-28 03:48:09,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:48:09,120 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 1150 treesize of output 1148 [2024-11-28 03:48:09,140 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 1792 treesize of output 1690 [2024-11-28 03:48:09,166 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 202 treesize of output 194 [2024-11-28 03:48:09,176 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 226 treesize of output 210 [2024-11-28 03:48:09,201 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 218 treesize of output 194 [2024-11-28 03:48:09,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:48:09,474 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 638 treesize of output 636 [2024-11-28 03:48:09,506 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 170 treesize of output 154 [2024-11-28 03:48:12,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:48:12,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 408 treesize of output 475 [2024-11-28 03:48:12,842 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:48:12,842 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 16 treesize of output 15 [2024-11-28 03:48:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 13 not checked. [2024-11-28 03:48:12,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752991229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:48:12,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:48:12,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 44 [2024-11-28 03:48:12,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512023700] [2024-11-28 03:48:12,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:48:12,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-28 03:48:12,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:48:12,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-28 03:48:12,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1499, Unknown=4, NotChecked=324, Total=1980 [2024-11-28 03:48:12,899 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 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:48:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:48:15,409 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-28 03:48:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 03:48:15,410 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 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 47 [2024-11-28 03:48:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:48:15,410 INFO L225 Difference]: With dead ends: 93 [2024-11-28 03:48:15,410 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 03:48:15,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=342, Invalid=2640, Unknown=4, NotChecked=436, Total=3422 [2024-11-28 03:48:15,412 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:48:15,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 651 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1036 Invalid, 0 Unknown, 276 Unchecked, 1.2s Time] [2024-11-28 03:48:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 03:48:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-28 03:48:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.2533333333333334) 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:48:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-28 03:48:15,416 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 47 [2024-11-28 03:48:15,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:48:15,417 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-28 03:48:15,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 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:48:15,417 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-28 03:48:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 03:48:15,418 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:48:15,419 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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:48:15,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 03:48:15,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-28 03:48:15,620 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:48:15,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:48:15,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2131544921, now seen corresponding path program 1 times [2024-11-28 03:48:15,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:48:15,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141603896] [2024-11-28 03:48:15,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:48:15,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:48:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:48:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-28 03:48:15,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:48:15,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141603896] [2024-11-28 03:48:15,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141603896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:48:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:48:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:48:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256967998] [2024-11-28 03:48:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:48:15,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:48:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:48:15,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:48:15,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:48:15,802 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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:48:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:48:15,953 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-28 03:48:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:48:15,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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 49 [2024-11-28 03:48:15,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:48:15,956 INFO L225 Difference]: With dead ends: 92 [2024-11-28 03:48:15,956 INFO L226 Difference]: Without dead ends: 92 [2024-11-28 03:48:15,957 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:48:15,957 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:48:15,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 146 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:48:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-28 03:48:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-11-28 03:48:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.24) 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:48:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-28 03:48:15,964 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 49 [2024-11-28 03:48:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:48:15,965 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-28 03:48:15,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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:48:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-28 03:48:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 03:48:15,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:48:15,969 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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:48:15,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:48:15,969 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:48:15,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:48:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2131544922, now seen corresponding path program 1 times [2024-11-28 03:48:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:48:15,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798055766] [2024-11-28 03:48:15,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:48:15,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:48:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:48:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-28 03:48:16,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:48:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798055766] [2024-11-28 03:48:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798055766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:48:16,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:48:16,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:48:16,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696299874] [2024-11-28 03:48:16,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:48:16,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:48:16,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:48:16,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:48:16,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:48:16,284 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:48:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:48:16,454 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-28 03:48:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:48:16,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-28 03:48:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:48:16,456 INFO L225 Difference]: With dead ends: 91 [2024-11-28 03:48:16,456 INFO L226 Difference]: Without dead ends: 91 [2024-11-28 03:48:16,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:48:16,458 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:48:16,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 192 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:48:16,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-28 03:48:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-28 03:48:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.2266666666666666) 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:48:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-28 03:48:16,465 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 49 [2024-11-28 03:48:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:48:16,465 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-28 03:48:16,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:48:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-28 03:48:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 03:48:16,466 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:48:16,466 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 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:48:16,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:48:16,470 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:48:16,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:48:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash -364770338, now seen corresponding path program 1 times [2024-11-28 03:48:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:48:16,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380950287] [2024-11-28 03:48:16,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:48:16,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:48:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:48:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:48:19,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:48:19,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380950287] [2024-11-28 03:48:19,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380950287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:48:19,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334497395] [2024-11-28 03:48:19,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:48:19,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:48:19,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:48:19,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:48:19,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:48:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:48:19,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-28 03:48:19,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:48:19,694 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:48:19,694 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:48:19,911 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-28 03:48:19,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-28 03:48:20,060 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:48:20,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:48:20,427 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 03:48:20,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-11-28 03:48:20,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:48:20,550 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:48:20,567 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:48:20,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:48:20,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:48:20,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:48:20,734 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:48:20,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2024-11-28 03:48:20,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-28 03:48:20,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 03:48:20,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-28 03:48:20,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 03:48:20,941 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:48:20,968 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 47 treesize of output 27 [2024-11-28 03:48:20,977 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 20 treesize of output 15 [2024-11-28 03:48:20,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:48:21,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:48:21,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2024-11-28 03:48:21,313 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 20 treesize of output 15 [2024-11-28 03:48:21,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 03:48:21,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:48:21,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2024-11-28 03:48:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:48:21,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:48:22,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse2))) (and (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_1848 (Array Int Int))) (or (< .cse1 |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1848) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_16 Int) (v_ArrVal_1848 (Array Int Int))) (or (= v_prenex_16 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1848) .cse0) v_prenex_16) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_16 0) (< .cse1 v_prenex_16)))))) is different from false [2024-11-28 03:48:23,390 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1837 (Array Int Int))) (or (not (= v_ArrVal_1837 (store .cse0 .cse1 (select v_ArrVal_1837 .cse1)))) (forall ((v_prenex_16 Int) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1839 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1848 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1839) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1848) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) v_prenex_16) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_16) (< v_prenex_16 0) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_16))))) (forall ((v_ArrVal_1837 (Array Int Int))) (or (not (= v_ArrVal_1837 (store .cse0 .cse1 (select v_ArrVal_1837 .cse1)))) (forall ((v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1839 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_1848 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1839) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1848) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) |c_ULTIMATE.start_main_~data_init~0#1|))) (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))))) is different from false [2024-11-28 03:48:23,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1833 (Array Int Int))) (or (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1835 Int) (v_ArrVal_1837 (Array Int Int))) (or (forall ((v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1839 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1835)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_1848 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1839) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1848) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0)))))) (not (= v_ArrVal_1837 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1837 .cse3)))))) (not (= v_ArrVal_1833 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1833 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_1833 (Array Int Int))) (or (not (= v_ArrVal_1833 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1833 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1835 Int) (v_ArrVal_1837 (Array Int Int))) (or (forall ((v_prenex_16 Int) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1839 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1848 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_16) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_16) (< v_prenex_16 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1839) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1848) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1835)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) v_prenex_16) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= v_ArrVal_1837 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1837 .cse3)))))))))) is different from false [2024-11-28 03:48:23,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:48:23,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 226 treesize of output 233 [2024-11-28 03:48:23,639 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 334 treesize of output 319 [2024-11-28 03:48:23,654 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 310 treesize of output 294 [2024-11-28 03:48:23,669 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 294 treesize of output 286 [2024-11-28 03:48:23,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 283 [2024-11-28 03:48:23,698 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 484 treesize of output 466 [2024-11-28 03:48:23,717 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 491 treesize of output 487 [2024-11-28 03:48:23,738 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 435 treesize of output 427 [2024-11-28 03:48:23,752 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 427 treesize of output 423 [2024-11-28 03:48:23,767 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 423 treesize of output 419 [2024-11-28 03:48:23,783 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 419 treesize of output 411 [2024-11-28 03:48:23,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:48:23,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 411 treesize of output 442 [2024-11-28 03:48:23,853 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 391 treesize of output 387 [2024-11-28 03:48:23,875 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 387 treesize of output 379 [2024-11-28 03:48:24,392 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 13 treesize of output 1 [2024-11-28 03:48:24,511 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 13 treesize of output 1 [2024-11-28 03:48:24,532 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 13 treesize of output 1 [2024-11-28 03:48:26,234 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 13 treesize of output 1 [2024-11-28 03:48:26,252 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 13 treesize of output 1 [2024-11-28 03:48:26,279 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 13 treesize of output 1 [2024-11-28 03:48:26,318 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 13 treesize of output 1 [2024-11-28 03:48:26,347 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 13 treesize of output 1 [2024-11-28 03:48:26,408 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 13 treesize of output 1 [2024-11-28 03:48:26,466 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 13 treesize of output 1 [2024-11-28 03:48:27,805 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 13 treesize of output 1 [2024-11-28 03:48:27,825 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 13 treesize of output 1 [2024-11-28 03:48:27,852 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 13 treesize of output 1 [2024-11-28 03:48:27,879 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 13 treesize of output 1 [2024-11-28 03:48:27,897 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 13 treesize of output 1 [2024-11-28 03:48:27,929 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 13 treesize of output 1 [2024-11-28 03:48:27,987 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 13 treesize of output 1 [2024-11-28 03:48:28,044 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 13 treesize of output 1 [2024-11-28 03:48:28,070 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 13 treesize of output 1 [2024-11-28 03:48:28,204 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 13 treesize of output 1 [2024-11-28 03:48:28,230 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 13 treesize of output 1 [2024-11-28 03:48:28,948 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 13 treesize of output 1 [2024-11-28 03:48:28,995 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 13 treesize of output 1 [2024-11-28 03:48:29,083 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 13 treesize of output 1 [2024-11-28 03:48:29,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-28 03:48:29,293 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 13 treesize of output 1 [2024-11-28 03:48:30,204 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 13 treesize of output 1 [2024-11-28 03:48:30,232 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 13 treesize of output 1 [2024-11-28 03:48:30,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-28 03:48:30,308 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 13 treesize of output 1 [2024-11-28 03:48:30,349 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 13 treesize of output 1 [2024-11-28 03:48:30,375 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 13 treesize of output 1 [2024-11-28 03:48:30,465 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 13 treesize of output 1 [2024-11-28 03:48:30,484 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 13 treesize of output 1 [2024-11-28 03:48:30,512 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 13 treesize of output 1 [2024-11-28 03:48:30,555 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 13 treesize of output 1 [2024-11-28 03:48:30,587 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 13 treesize of output 1 [2024-11-28 03:48:30,717 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 13 treesize of output 1 [2024-11-28 03:48:30,740 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 13 treesize of output 1 [2024-11-28 03:48:31,941 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 13 treesize of output 1 [2024-11-28 03:48:31,973 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 13 treesize of output 1 [2024-11-28 03:48:32,028 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 13 treesize of output 1 [2024-11-28 03:48:32,061 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 8 treesize of output 6 [2024-11-28 03:48:32,126 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 5008 treesize of output 4818 [2024-11-28 03:48:34,875 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 8 treesize of output 6 [2024-11-28 03:48:35,062 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 8 treesize of output 6 [2024-11-28 03:48:35,072 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 8 treesize of output 6 [2024-11-28 03:48:35,178 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 8 treesize of output 6 [2024-11-28 03:48:35,478 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 8 treesize of output 6 [2024-11-28 03:48:35,492 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 8 treesize of output 6 [2024-11-28 03:48:36,178 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 8 treesize of output 6 [2024-11-28 03:48:36,190 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 8 treesize of output 6 [2024-11-28 03:48:36,439 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 8 treesize of output 6 [2024-11-28 03:48:36,464 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 8 treesize of output 6 [2024-11-28 03:48:36,471 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 8 treesize of output 6 [2024-11-28 03:48:36,608 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 8 treesize of output 6 [2024-11-28 03:48:36,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 4972 treesize of output 4776 [2024-11-28 03:50:03,544 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:03,673 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 03:50:03,674 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 2 case distinctions, treesize of input 15523 treesize of output 15285 [2024-11-28 03:50:03,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 228 treesize of output 212 [2024-11-28 03:50:03,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:03,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 221 [2024-11-28 03:50:03,793 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:03,803 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 176 treesize of output 168 [2024-11-28 03:50:03,822 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 116 treesize of output 106 [2024-11-28 03:50:03,852 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:50:04,082 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:04,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:04,112 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 30 treesize of output 34 [2024-11-28 03:50:04,725 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 03:50:04,725 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 2 case distinctions, treesize of input 141 treesize of output 155 [2024-11-28 03:50:04,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:04,768 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 432 treesize of output 428 [2024-11-28 03:50:04,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:04,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 222 [2024-11-28 03:50:04,800 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:04,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 194 [2024-11-28 03:50:04,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 186 [2024-11-28 03:50:05,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:05,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:05,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2024-11-28 03:50:05,206 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:05,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:05,218 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 46 treesize of output 46 [2024-11-28 03:50:05,249 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 47 treesize of output 43 [2024-11-28 03:50:05,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:05,265 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-28 03:50:05,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:05,293 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2024-11-28 03:50:05,306 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 9 treesize of output 7 [2024-11-28 03:50:05,326 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 12 treesize of output 8 [2024-11-28 03:50:05,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:05,357 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 18 treesize of output 12 [2024-11-28 03:50:05,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:05,392 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 21 treesize of output 25 [2024-11-28 03:50:05,477 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:05,582 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 03:50:05,583 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 277 treesize of output 291 [2024-11-28 03:50:05,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:05,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 345 treesize of output 343 [2024-11-28 03:50:05,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:05,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 298 treesize of output 290 [2024-11-28 03:50:05,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 246 [2024-11-28 03:50:05,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 245 [2024-11-28 03:50:05,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:05,932 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:05,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:05,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 145 [2024-11-28 03:50:06,216 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:06,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:06,235 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 507 treesize of output 499 [2024-11-28 03:50:06,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:06,289 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 200 treesize of output 200 [2024-11-28 03:50:06,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 225 [2024-11-28 03:50:06,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 243 [2024-11-28 03:50:06,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-28 03:50:06,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:06,575 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:06,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-11-28 03:50:06,609 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:06,838 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-28 03:50:06,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5832 treesize of output 5780 [2024-11-28 03:50:06,886 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 236 treesize of output 218 [2024-11-28 03:50:07,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:07,021 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 400 treesize of output 408 [2024-11-28 03:50:07,044 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:07,050 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 321 treesize of output 307 [2024-11-28 03:50:07,076 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 229 treesize of output 197 [2024-11-28 03:50:07,505 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:50:07,577 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:50:07,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:07,753 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:50:07,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:09,407 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:09,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:09,439 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 30 treesize of output 34 [2024-11-28 03:50:10,878 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 112 treesize of output 108 [2024-11-28 03:50:10,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2024-11-28 03:50:10,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2024-11-28 03:50:10,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2024-11-28 03:50:11,035 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:11,152 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 03:50:11,152 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 2 case distinctions, treesize of input 519 treesize of output 529 [2024-11-28 03:50:11,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:11,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 345 treesize of output 343 [2024-11-28 03:50:11,231 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:11,237 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 298 treesize of output 290 [2024-11-28 03:50:11,262 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 271 treesize of output 261 [2024-11-28 03:50:11,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 238 [2024-11-28 03:50:11,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:11,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:11,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:11,634 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 143 treesize of output 145 [2024-11-28 03:50:12,312 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:12,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:12,328 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 46 treesize of output 46 [2024-11-28 03:50:12,355 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 47 treesize of output 43 [2024-11-28 03:50:12,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:12,373 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-28 03:50:12,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:12,404 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2024-11-28 03:50:12,418 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 9 treesize of output 7 [2024-11-28 03:50:12,456 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 12 treesize of output 8 [2024-11-28 03:50:12,491 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:12,491 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 18 treesize of output 12 [2024-11-28 03:50:12,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:12,530 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 21 treesize of output 25 [2024-11-28 03:50:12,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:12,652 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 52 treesize of output 48 [2024-11-28 03:50:12,662 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 22 [2024-11-28 03:50:12,672 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 46 treesize of output 42 [2024-11-28 03:50:12,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:12,739 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:12,984 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-28 03:50:12,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2205 treesize of output 2213 [2024-11-28 03:50:13,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 455 treesize of output 423 [2024-11-28 03:50:13,080 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:13,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:13,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 507 treesize of output 515 [2024-11-28 03:50:13,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:13,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 533 treesize of output 519 [2024-11-28 03:50:13,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 500 treesize of output 482 [2024-11-28 03:50:13,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 03:50:14,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 03:50:14,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:15,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:15,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:15,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 406 treesize of output 402 [2024-11-28 03:50:16,608 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:16,620 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:16,860 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-28 03:50:16,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1480 treesize of output 1492 [2024-11-28 03:50:17,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:17,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 471 treesize of output 479 [2024-11-28 03:50:17,033 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:17,039 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 445 treesize of output 431 [2024-11-28 03:50:17,066 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 262 treesize of output 246 [2024-11-28 03:50:17,092 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 396 treesize of output 378 [2024-11-28 03:50:17,167 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:50:18,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:18,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:18,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:18,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 219 treesize of output 217 [2024-11-28 03:50:19,807 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:19,916 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 03:50:19,917 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 2 case distinctions, treesize of input 519 treesize of output 529 [2024-11-28 03:50:19,939 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 228 treesize of output 212 [2024-11-28 03:50:19,956 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 221 treesize of output 211 [2024-11-28 03:50:19,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:20,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2024-11-28 03:50:20,018 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:20,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:20,045 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 145 [2024-11-28 03:50:20,087 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:50:20,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:20,346 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2024-11-28 03:50:20,368 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 19 treesize of output 13 [2024-11-28 03:50:20,413 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:20,414 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 54 treesize of output 48 [2024-11-28 03:50:20,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:20,558 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 157 treesize of output 157 [2024-11-28 03:50:20,944 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:20,951 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:21,183 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-28 03:50:21,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 755 treesize of output 783 [2024-11-28 03:50:21,214 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 177 treesize of output 159 [2024-11-28 03:50:21,252 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:21,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:21,332 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 348 treesize of output 356 [2024-11-28 03:50:21,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:21,362 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 269 treesize of output 255 [2024-11-28 03:50:21,392 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 114 treesize of output 98 [2024-11-28 03:50:21,491 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:50:22,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:22,048 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 03:50:22,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:22,130 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:50:23,248 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:23,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:23,281 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 159 treesize of output 161 [2024-11-28 03:50:25,113 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:25,120 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:25,241 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 03:50:25,242 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 2 case distinctions, treesize of input 526 treesize of output 528 [2024-11-28 03:50:25,270 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:25,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:25,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 169 [2024-11-28 03:50:25,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:25,325 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 124 treesize of output 116 [2024-11-28 03:50:25,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2024-11-28 03:50:25,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:25,550 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:25,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:25,579 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 30 treesize of output 34 [2024-11-28 03:50:25,982 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:25,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:25,995 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 46 treesize of output 46 [2024-11-28 03:50:26,018 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 47 treesize of output 43 [2024-11-28 03:50:26,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:26,036 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-28 03:50:26,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:26,067 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2024-11-28 03:50:26,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-28 03:50:26,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-28 03:50:26,132 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:26,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2024-11-28 03:50:26,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:26,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-28 03:50:26,285 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:26,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:26,416 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 03:50:26,416 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 523 treesize of output 525 [2024-11-28 03:50:26,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:26,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 169 [2024-11-28 03:50:26,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:26,493 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 124 treesize of output 116 [2024-11-28 03:50:26,509 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 64 treesize of output 54 [2024-11-28 03:50:26,527 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:50:26,719 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:26,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:26,749 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 30 treesize of output 34 [2024-11-28 03:50:27,084 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:27,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:27,100 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 46 treesize of output 46 [2024-11-28 03:50:27,122 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 47 treesize of output 43 [2024-11-28 03:50:27,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:27,141 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-28 03:50:27,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:27,171 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2024-11-28 03:50:27,183 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 9 treesize of output 7 [2024-11-28 03:50:27,205 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 12 treesize of output 8 [2024-11-28 03:50:27,223 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:27,223 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 23 treesize of output 17 [2024-11-28 03:50:27,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:27,282 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 21 treesize of output 25 [2024-11-28 03:50:27,375 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:27,386 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:27,504 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 03:50:27,505 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 2 case distinctions, treesize of input 282 treesize of output 292 [2024-11-28 03:50:27,534 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:27,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:27,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 223 [2024-11-28 03:50:27,593 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:27,598 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 178 treesize of output 170 [2024-11-28 03:50:27,614 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 151 treesize of output 141 [2024-11-28 03:50:27,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:50:27,797 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:27,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:27,828 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 91 treesize of output 93 [2024-11-28 03:50:28,200 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:28,316 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 03:50:28,316 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 2 case distinctions, treesize of input 1974 treesize of output 1960 [2024-11-28 03:50:28,363 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:28,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:28,395 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 231 treesize of output 229 [2024-11-28 03:50:28,411 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:28,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 176 [2024-11-28 03:50:28,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 246 [2024-11-28 03:50:28,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 106 [2024-11-28 03:50:28,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 03:50:28,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:28,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:28,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2024-11-28 03:50:29,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:29,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:29,390 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 46 treesize of output 46 [2024-11-28 03:50:29,412 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 47 treesize of output 43 [2024-11-28 03:50:29,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:29,442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 50 [2024-11-28 03:50:29,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:29,461 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2024-11-28 03:50:29,474 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 9 treesize of output 7 [2024-11-28 03:50:29,508 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 12 treesize of output 8 [2024-11-28 03:50:29,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:29,541 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 18 treesize of output 12 [2024-11-28 03:50:29,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:29,580 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 21 treesize of output 25 [2024-11-28 03:50:29,671 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:29,791 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 03:50:29,791 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 2 case distinctions, treesize of input 519 treesize of output 529 [2024-11-28 03:50:29,818 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 237 treesize of output 227 [2024-11-28 03:50:29,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:29,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 337 treesize of output 335 [2024-11-28 03:50:29,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:29,912 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 290 treesize of output 282 [2024-11-28 03:50:29,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 238 [2024-11-28 03:50:30,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:30,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:30,680 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 21 treesize of output 25 [2024-11-28 03:50:30,771 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:30,781 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:30,901 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 03:50:30,901 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 171 [2024-11-28 03:50:30,917 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 117 treesize of output 107 [2024-11-28 03:50:30,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:30,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 217 treesize of output 215 [2024-11-28 03:50:30,985 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:30,991 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 170 treesize of output 162 [2024-11-28 03:50:31,010 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:50:31,197 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:31,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:31,227 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 91 treesize of output 93 [2024-11-28 03:50:31,407 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:31,419 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:31,426 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:31,673 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-28 03:50:31,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 515 treesize of output 543 [2024-11-28 03:50:31,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:31,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:31,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 351 treesize of output 359 [2024-11-28 03:50:31,827 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:31,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 311 [2024-11-28 03:50:31,857 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 292 treesize of output 274 [2024-11-28 03:50:31,939 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:50:33,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:33,358 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 32 [2024-11-28 03:50:33,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:50:33,592 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:50:33,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:50:33,622 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 312 treesize of output 308 [2024-11-28 03:51:59,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:51:59,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 95 treesize of output 363 [2024-11-28 03:52:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-28 03:52:06,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334497395] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:52:06,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:52:06,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 24] total 68 [2024-11-28 03:52:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007441496] [2024-11-28 03:52:06,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:52:06,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-28 03:52:06,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:52:06,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-28 03:52:06,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=3778, Unknown=139, NotChecked=384, Total=4556 [2024-11-28 03:52:06,907 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 68 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 68 states have internal predecessors, (144), 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:52:53,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 03:53:29,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:33,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:37,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:53:41,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:54:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:10,896 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2024-11-28 03:54:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 03:54:10,948 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 68 states have internal predecessors, (144), 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 51 [2024-11-28 03:54:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:10,948 INFO L225 Difference]: With dead ends: 86 [2024-11-28 03:54:10,948 INFO L226 Difference]: Without dead ends: 86 [2024-11-28 03:54:10,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 204.6s TimeCoverageRelationStatistics Valid=665, Invalid=6496, Unknown=161, NotChecked=510, Total=7832 [2024-11-28 03:54:10,951 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 56 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 67.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:10,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 900 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1400 Invalid, 4 Unknown, 148 Unchecked, 67.3s Time] [2024-11-28 03:54:10,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-28 03:54:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-28 03:54:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 85 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:54:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2024-11-28 03:54:10,955 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 51 [2024-11-28 03:54:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:10,956 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2024-11-28 03:54:10,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 68 states have internal predecessors, (144), 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:54:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2024-11-28 03:54:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-28 03:54:10,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:10,957 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:10,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:54:11,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 03:54:11,158 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 03:54:11,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:11,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1645831285, now seen corresponding path program 2 times [2024-11-28 03:54:11,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:11,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121831513] [2024-11-28 03:54:11,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:54:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:11,274 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:54:11,274 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:54:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:19,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:19,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121831513] [2024-11-28 03:54:19,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121831513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:54:19,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655391389] [2024-11-28 03:54:19,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:54:19,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:54:19,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:54:19,044 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:54:19,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:54:19,346 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:54:19,346 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:54:19,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-28 03:54:19,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:54:19,756 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:54:19,756 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:54:21,024 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-28 03:54:21,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-28 03:54:21,629 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:54:21,729 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:54:22,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:54:22,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:54:22,397 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:54:22,397 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 58 treesize of output 51 [2024-11-28 03:54:22,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 03:54:23,838 INFO L349 Elim1Store]: treesize reduction 72, result has 33.3 percent of original size [2024-11-28 03:54:23,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 33 treesize of output 48 [2024-11-28 03:54:24,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:54:24,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-11-28 03:54:25,404 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 03:54:25,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 35 [2024-11-28 03:54:25,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:25,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-28 03:54:25,595 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 03:54:25,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 69 [2024-11-28 03:54:25,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:25,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-28 03:54:27,313 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-28 03:54:27,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 75 [2024-11-28 03:54:27,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:27,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:27,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-11-28 03:54:28,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:28,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:28,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:28,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2024-11-28 03:54:28,319 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-11-28 03:54:28,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 126 treesize of output 82 [2024-11-28 03:54:30,771 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-28 03:54:30,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 146 treesize of output 96 [2024-11-28 03:54:30,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:30,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:30,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:30,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2024-11-28 03:54:33,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:33,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:33,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:54:34,036 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-28 03:54:34,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2024-11-28 03:54:34,496 INFO L349 Elim1Store]: treesize reduction 160, result has 23.1 percent of original size [2024-11-28 03:54:34,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 153 treesize of output 111 [2024-11-28 03:54:35,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:54:35,407 INFO L349 Elim1Store]: treesize reduction 36, result has 30.8 percent of original size [2024-11-28 03:54:35,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 157 treesize of output 88 [2024-11-28 03:54:35,504 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2024-11-28 03:54:35,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 25 [2024-11-28 03:54:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:37,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:54:41,858 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse2 (select .cse6 .cse4)) (.cse0 (select .cse3 .cse4))) (and (or (= |c_ULTIMATE.start_main_~head~1#1.base| .cse0) (and (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~ptr~0#1.offset| v_ArrVal_2122)) .cse0) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (= .cse1 |c_ULTIMATE.start_main_~head~1#1.base|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (< .cse2 |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= (select |c_#valid| .cse1) 1)))) (forall ((v_ArrVal_2124 (Array Int Int))) (or (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (< (select v_ArrVal_2124 .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= |c_ULTIMATE.start_main_~head~1#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_2124) .cse0) .cse5)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~ptr~0#1.offset| v_ArrVal_2122)) .cse0) .cse5)) 1)))) (not (= (store .cse6 |c_ULTIMATE.start_main_~ptr~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) v_ArrVal_2124)))))) (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~ptr~0#1.offset| v_ArrVal_2122)) .cse0) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_main_~head~1#1.offset|) (= .cse7 |c_ULTIMATE.start_main_~head~1#1.base|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (< .cse2 |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= (select |c_#valid| .cse7) 1)))) (forall ((v_ArrVal_2124 (Array Int Int))) (or (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (< (select v_ArrVal_2124 .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_main_~head~1#1.offset|) (= |c_ULTIMATE.start_main_~head~1#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_2124) .cse0) .cse8)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~ptr~0#1.offset| v_ArrVal_2122)) .cse0) .cse8)) 1)))) (not (= (store .cse6 |c_ULTIMATE.start_main_~ptr~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) v_ArrVal_2124))))))) is different from false [2024-11-28 03:54:42,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse4 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse8 (select .cse0 .cse4)) (.cse2 (select .cse1 .cse4))) (and (forall ((v_ArrVal_2124 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) v_ArrVal_2124)) (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.offset| v_ArrVal_2122)) .cse2) .cse3)) 1) (< (select v_ArrVal_2124 .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_2124) .cse2) .cse3) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))) (or (= .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (forall ((v_ArrVal_2124 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) v_ArrVal_2124)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (< (select v_ArrVal_2124 .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= (select |c_#valid| (select .cse5 .cse6)) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_2124) .cse2) .cse6) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse7 (select .cse5 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (= .cse7 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (select |c_#valid| .cse7) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (< .cse8 |v_ULTIMATE.start_main_~ptr~0#1.offset_42|))))))) (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.offset| v_ArrVal_2122)) .cse2) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (= (select |c_#valid| .cse9) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= .cse9 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (< .cse8 |v_ULTIMATE.start_main_~ptr~0#1.offset_42|))))))) is different from false [2024-11-28 03:54:43,352 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse5 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse0 (select .cse4 .cse5)) (.cse3 (select .cse2 .cse5))) (and (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2122)) .cse3) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< .cse0 |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| .cse1) 1)))) (forall ((v_ArrVal_2124 (Array Int Int))) (or (not (= (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_ArrVal_2124)) (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (select v_ArrVal_2124 .cse5) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2124) .cse3) .cse6) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2122)) .cse3) .cse6)) 1)))))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((v_ArrVal_2124 (Array Int Int))) (or (not (= (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_ArrVal_2124)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (< (select v_ArrVal_2124 .cse5) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2124) .cse3) .cse7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| (select .cse8 .cse7)) 1)))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse9 (select .cse8 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (< .cse0 |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |c_#valid| .cse9) 1)))))))))) is different from false [2024-11-28 03:54:43,687 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse12 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse4 (store .cse10 .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse0 (store .cse11 .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (select .cse11 .cse1)) (.cse2 (select .cse10 .cse1))) (and (forall ((v_ArrVal_2124 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_ArrVal_2124)) (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (select v_ArrVal_2124 .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2124) .cse2) .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2122)) .cse2) .cse3)) 1)))))) (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2122)) .cse2) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< .cse5 |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse6)))) (or (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (forall ((v_ArrVal_2124 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_ArrVal_2124)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (< (select v_ArrVal_2124 .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2124) .cse2) .cse7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| (select .cse8 .cse7)) 1)))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse9 (select .cse8 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (< .cse5 |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |c_#valid| .cse9) 1)))))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2024-11-28 03:54:44,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse14 (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse6 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse12 (store .cse14 .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse0 (select .cse14 .cse1))) (and (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (let ((.cse3 (select .cse9 .cse0))) (and (forall ((v_ArrVal_2116 Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2)) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse3 .cse2))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2116))) (forall ((v_ArrVal_2116 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2116) (forall ((v_ArrVal_2124 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse7 .cse8 v_ArrVal_2116)))) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (< (select v_ArrVal_2124 .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= 1 (select |c_#valid| (select .cse3 .cse4))) (= (select (select (store .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2124) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) .cse4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0)))) (not (= (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_ArrVal_2124)))))))))) (forall ((v_ArrVal_2116 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2116) (forall ((v_ArrVal_2124 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse7 .cse8 v_ArrVal_2116)))) (or (not (= (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_ArrVal_2124)) (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (select v_ArrVal_2124 .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select (select (store .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2124) .cse0) .cse11) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2122)) .cse0) .cse11)) 1))))))))) (forall ((v_ArrVal_2116 Int)) (or (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse13 (select (select (store .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2122)) .cse0) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (= .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse7 .cse8 v_ArrVal_2116)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| .cse13) 1)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2116)))))))) is different from false [2024-11-28 03:54:44,791 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse15 (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse7 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse13 (store .cse15 .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse0 (select .cse15 .cse1))) (and (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (let ((.cse4 (select .cse10 .cse0)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3)) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse4 .cse3))))) (forall ((v_ArrVal_2116 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2116) (forall ((v_ArrVal_2124 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse8 .cse9 v_ArrVal_2116)))) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (< (select v_ArrVal_2124 .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= 1 (select |c_#valid| (select .cse4 .cse5))) (= (select (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2124) .cse2) .cse5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0)))) (not (= (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_ArrVal_2124)))))))))) (forall ((v_ArrVal_2116 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2116) (forall ((v_ArrVal_2124 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse8 .cse9 v_ArrVal_2116)))) (or (not (= (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_ArrVal_2124)) (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse12 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (select v_ArrVal_2124 .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select (select (store .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2124) .cse0) .cse12) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2122)) .cse0) .cse12)) 1))))))))) (forall ((v_ArrVal_2116 Int)) (or (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse14 (select (select (store .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2122)) .cse0) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (= .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse8 .cse9 v_ArrVal_2116)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| .cse14) 1)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2116)))))))) is different from false [2024-11-28 03:54:45,277 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse15 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8))) (let ((.cse5 (store .cse15 .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse6 (select .cse15 .cse3))) (and (forall ((v_ArrVal_2116 Int)) (or (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2122)) .cse6) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse1 .cse2 v_ArrVal_2116)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|)))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2116))) (forall ((v_ArrVal_2116 Int)) (or (forall ((v_ArrVal_2124 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse1 .cse2 v_ArrVal_2116)))) (or (not (= (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2124)) (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= (select |c_#valid| (select (select (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2122)) .cse6) .cse9)) 1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2124) .cse6) .cse9)) (< (select v_ArrVal_2124 .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2116))) (or (let ((.cse12 (select .cse4 .cse6)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse10) .cse11)) 1) (= (select .cse12 .cse11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|)))) (forall ((v_ArrVal_2116 Int)) (or (forall ((v_ArrVal_2124 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse1 .cse2 v_ArrVal_2116)))) (or (not (= (store (store (select .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2124)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (< (select v_ArrVal_2124 .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| (select .cse12 .cse14)) 1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2124) .cse10) .cse14)))))))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2116))))) (= .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) is different from false [2024-11-28 03:54:45,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse17 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse5 (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse17 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse16 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8))) (let ((.cse6 (store .cse16 .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse7 (select .cse16 .cse4)) (.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_ArrVal_2116 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2116) (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2122)) .cse7) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (= (select |c_#valid| .cse0) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (< (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 .cse3 v_ArrVal_2116)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (or (let ((.cse8 (select .cse5 .cse7))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= (select .cse8 .cse9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| (select (select .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)) .cse9)) 1)))) (forall ((v_ArrVal_2116 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2116) (forall ((v_ArrVal_2124 (Array Int Int))) (let ((.cse11 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 .cse3 v_ArrVal_2116)))) (or (not (= (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2124)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (< (select v_ArrVal_2124 .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= (select |c_#valid| (select .cse8 .cse13)) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select (select (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2124) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)) .cse13) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))))))) (= .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_ArrVal_2116 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2116) (forall ((v_ArrVal_2124 (Array Int Int))) (let ((.cse14 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 .cse3 v_ArrVal_2116)))) (or (not (= (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2124)) (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= (select |c_#valid| (select (select (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2122)) .cse7) .cse15)) 1) (< (select v_ArrVal_2124 .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= (select (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2124) .cse7) .cse15) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))))))))))) is different from false [2024-11-28 03:54:47,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse8 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_2111 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse0 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2111)))) (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse5 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) .cse2)) 1) (< (select .cse3 .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse5 .cse4) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_2113 (Array Int Int))) (or (not (= (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2113 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2113)) (forall ((v_ArrVal_2111 Int) (v_ArrVal_2116 Int)) (or (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse10 (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2111)))) (let ((.cse13 (store (select .cse18 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse13))) (let ((.cse14 (store (select .cse17 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse15 (select (store .cse17 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse14) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse13) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse14) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse15 .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2122)) (select .cse15 .cse1))))))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse10) (= (select |c_#valid| .cse10) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (< (select (select (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2113))) (store .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (store .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse6 v_ArrVal_2116))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2116))))) (forall ((v_ArrVal_2113 (Array Int Int))) (or (forall ((v_ArrVal_2111 Int)) (let ((.cse22 (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2111)))) (store .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_ArrVal_2116 Int)) (or (forall ((v_ArrVal_2124 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2113))) (let ((.cse19 (store (select .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse19))) (let ((.cse20 (store (select .cse24 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse6 v_ArrVal_2116))) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse21 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse19) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse20) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2124) (select .cse9 .cse1)) .cse21)) (< (select v_ArrVal_2124 .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= (select |c_#valid| (select (select .cse22 .cse23) .cse21)) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0)))) (not (= (store (store (select (store .cse24 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse20) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2124)))))))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2116))) (= .cse23 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (not (= (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2113 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2113)))) (forall ((v_ArrVal_2113 (Array Int Int))) (or (forall ((v_ArrVal_2111 Int) (v_ArrVal_2116 Int)) (or (forall ((v_ArrVal_2124 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2113))) (let ((.cse33 (store (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse33))) (let ((.cse34 (store (select .cse37 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse6 v_ArrVal_2116))) (or (forall ((v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse36 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2111)))) (let ((.cse28 (store (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse35 (store .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse28))) (let ((.cse29 (store (select .cse35 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse30 (select (store .cse35 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse29) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse31 (select .cse30 .cse1)) (.cse32 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= (select |c_#valid| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse28) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse29) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse30 .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2122)) .cse31) .cse32)) 1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse33) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse34) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2124) .cse31) .cse32)) (< (select v_ArrVal_2124 .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))))) (not (= (store (store (select (store .cse37 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse34) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2124)))))))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2116))) (not (= (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2113 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2113)))))) is different from false [2024-11-28 03:54:48,462 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse13 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse14 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int) (v_ArrVal_2111 Int) (v_ArrVal_2113 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2116 Int)) (let ((.cse9 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2113) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse9)) (.cse0 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2111)))) (store .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (store .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)) (.cse5 (select v_ArrVal_2113 .cse4)) (.cse7 (store (select .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 v_ArrVal_2116)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= (select |c_#valid| (select (select .cse0 .cse1) .cse2)) 1) (not (= (store (store .cse3 .cse4 .cse5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2113 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2113)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| .cse5) (not (= (store (store (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2124)) (< (select v_ArrVal_2124 .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse9) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2124) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2116)))))) (forall ((v_ArrVal_2111 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int)) (let ((.cse16 (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2111)))) (store .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse18 (store .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)) (.cse17 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4))) (or (= .cse15 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| (select (select .cse16 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)) .cse17)) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (= (select (select .cse18 .cse15) .cse17) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_42|)))))) (forall ((v_ArrVal_2111 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int) (v_ArrVal_2122 Int) (v_ArrVal_2113 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2116 Int)) (let ((.cse31 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2111)))) (let ((.cse25 (store (select .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse30 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2113)) (.cse29 (store .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse25))) (let ((.cse26 (store (select .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse21 (store (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse28 (store .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse21)) (.cse27 (select (store .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse26) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse20 (select v_ArrVal_2113 .cse4)) (.cse23 (select .cse27 .cse4)) (.cse24 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)) (.cse22 (store (select .cse28 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 v_ArrVal_2116))) (or (not (= (store (store .cse3 .cse4 .cse20) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2113 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2113)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| .cse20) (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse21) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse22) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2124) .cse23) .cse24) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select |c_#valid| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse25) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse26) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse27 .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2122)) .cse23) .cse24)) 1) (< (select v_ArrVal_2124 .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (not (= (store (store (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse22) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2124)) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2116))))))))) (forall ((v_ArrVal_2111 Int) (v_ArrVal_2122 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_42| Int) (v_ArrVal_2113 (Array Int Int)) (v_ArrVal_2116 Int)) (let ((.cse32 (select v_ArrVal_2113 .cse4)) (.cse33 (select (let ((.cse40 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2111)))) (let ((.cse36 (store (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse39 (store .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse36))) (let ((.cse37 (store (select .cse39 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse38 (select (store .cse39 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse37) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse36) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse37) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse38 .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2122)) (select .cse38 .cse4))))))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 4)))) (or (not (= (store (store .cse3 .cse4 .cse32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2113 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2113)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| .cse32) (= (select |c_#valid| .cse33) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_42| 0) (< (select (select (let ((.cse34 (let ((.cse35 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2113))) (store .cse35 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse35 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (store .cse34 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse34 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 v_ArrVal_2116))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_42|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2116) (= .cse33 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) is different from false [2024-11-28 03:55:45,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:55:45,634 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:55:46,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:55:46,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42124 treesize of output 41912 [2024-11-28 03:55:46,401 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:55:46,675 INFO L224 Elim1Store]: Index analysis took 348 ms [2024-11-28 03:55:48,786 INFO L349 Elim1Store]: treesize reduction 158, result has 29.5 percent of original size [2024-11-28 03:55:48,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 2104 treesize of output 2109 [2024-11-28 03:55:49,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:55:52,411 INFO L349 Elim1Store]: treesize reduction 288, result has 32.6 percent of original size [2024-11-28 03:55:52,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 29 case distinctions, treesize of input 713122 treesize of output 489802 [2024-11-28 03:55:56,649 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:55:57,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:55:57,097 INFO L224 Elim1Store]: Index analysis took 373 ms [2024-11-28 03:56:00,679 INFO L349 Elim1Store]: treesize reduction 352, result has 40.8 percent of original size [2024-11-28 03:56:00,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 14 new quantified variables, introduced 54 case distinctions, treesize of input 90949 treesize of output 86521 [2024-11-28 03:56:06,237 WARN L286 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 1033 DAG size of output: 979 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:56:07,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:56:07,070 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:56:07,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:56:07,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:56:07,138 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 56545 treesize of output 55849 [2024-11-28 03:57:27,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-28 03:57:30,150 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:30,153 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:30,158 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:30,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:30,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:57:30,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 125 treesize of output 153 [2024-11-28 03:57:33,098 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:33,114 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:33,117 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:33,120 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:33,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:57:33,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 113 [2024-11-28 03:57:34,712 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 03:57:34,896 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:34,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:35,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:57:35,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 65 [2024-11-28 03:57:35,711 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:35,714 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:35,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:57:35,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 65 [2024-11-28 03:57:36,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:36,445 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:37,498 INFO L349 Elim1Store]: treesize reduction 111, result has 33.1 percent of original size [2024-11-28 03:57:37,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 29545 treesize of output 29005 [2024-11-28 03:57:49,178 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:49,178 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:49,773 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-11-28 03:57:49,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 553 treesize of output 559 [2024-11-28 03:57:56,233 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:56,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:57:56,520 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-11-28 03:57:56,520 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 601 treesize of output 553 [2024-11-28 04:00:06,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 04:00:06,283 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 04:00:06,285 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 04:00:06,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:00:06,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:06,486 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:584) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 61 more [2024-11-28 04:00:06,492 INFO L158 Benchmark]: Toolchain (without parser) took 740505.12ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 91.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 921.0MB. Max. memory is 16.1GB. [2024-11-28 04:00:06,492 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:00:06,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.27ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 73.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:00:06,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.34ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 72.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:00:06,494 INFO L158 Benchmark]: Boogie Preprocessor took 90.74ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 70.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:00:06,494 INFO L158 Benchmark]: RCFGBuilder took 738.72ms. Allocated memory is still 117.4MB. Free memory was 70.0MB in the beginning and 50.6MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:00:06,494 INFO L158 Benchmark]: TraceAbstraction took 739002.18ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 49.8MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 879.1MB. Max. memory is 16.1GB. [2024-11-28 04:00:06,496 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 601.27ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 73.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.34ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 72.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 90.74ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 70.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 738.72ms. Allocated memory is still 117.4MB. Free memory was 70.0MB in the beginning and 50.6MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 739002.18ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 49.8MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 879.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/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_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/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 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:00:09,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:00:09,302 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 04:00:09,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:00:09,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:00:09,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:00:09,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:00:09,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:00:09,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:00:09,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:00:09,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:00:09,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:00:09,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:00:09,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:00:09,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:00:09,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:00:09,366 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:00:09,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:00:09,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:00:09,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:00:09,368 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:00:09,368 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:00:09,368 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:00:09,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:00:09,368 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:00:09,368 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 04:00:09,368 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 04:00:09,369 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:00:09,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:00:09,369 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:00:09,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:00:09,369 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:00:09,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:00:09,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:00:09,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:00:09,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:00:09,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:00:09,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:00:09,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:00:09,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:00:09,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:00:09,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:00:09,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:00:09,370 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 04:00:09,370 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 04:00:09,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:00:09,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:00:09,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:00:09,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:00:09,371 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_854cf018-a55d-493a-95e3-a2e7946899a3/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 -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2024-11-28 04:00:09,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:00:09,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:00:09,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:00:09,747 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:00:09,748 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:00:09,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-28 04:00:12,960 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/data/0ed7edfda/c346b0f8dc754d9988ae80a4112567fd/FLAGe98002c1b [2024-11-28 04:00:13,314 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:00:13,314 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-28 04:00:13,337 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/data/0ed7edfda/c346b0f8dc754d9988ae80a4112567fd/FLAGe98002c1b [2024-11-28 04:00:13,359 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/data/0ed7edfda/c346b0f8dc754d9988ae80a4112567fd [2024-11-28 04:00:13,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:00:13,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:00:13,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:00:13,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:00:13,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:00:13,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:13,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756bfb1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13, skipping insertion in model container [2024-11-28 04:00:13,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:13,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:00:13,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:00:13,828 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:00:13,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:00:13,939 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:00:13,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13 WrapperNode [2024-11-28 04:00:13,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:00:13,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:00:13,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:00:13,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:00:13,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:13,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:14,016 INFO L138 Inliner]: procedures = 125, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-11-28 04:00:14,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:00:14,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:00:14,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:00:14,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:00:14,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:14,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:14,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:14,065 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2024-11-28 04:00:14,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:14,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:14,083 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:14,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:14,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:14,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:14,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:14,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:00:14,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:00:14,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:00:14,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:00:14,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (1/1) ... [2024-11-28 04:00:14,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:00:14,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:14,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:00:14,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:00:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-28 04:00:14,195 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-28 04:00:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 04:00:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 04:00:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:00:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:00:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:00:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:00:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:00:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:00:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:00:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 04:00:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 04:00:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 04:00:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 04:00:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:00:14,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:00:14,354 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:00:14,356 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:00:14,388 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-28 04:00:15,062 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-28 04:00:15,062 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:00:15,084 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:00:15,084 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 04:00:15,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:00:15 BoogieIcfgContainer [2024-11-28 04:00:15,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:00:15,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:00:15,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:00:15,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:00:15,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:00:13" (1/3) ... [2024-11-28 04:00:15,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb57e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:00:15, skipping insertion in model container [2024-11-28 04:00:15,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:00:13" (2/3) ... [2024-11-28 04:00:15,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb57e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:00:15, skipping insertion in model container [2024-11-28 04:00:15,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:00:15" (3/3) ... [2024-11-28 04:00:15,102 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2024-11-28 04:00:15,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:00:15,123 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_circular_traversal-2.i that has 2 procedures, 85 locations, 1 initial locations, 3 loop locations, and 35 error locations. [2024-11-28 04:00:15,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:00:15,200 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;@8e41eeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:00:15,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-28 04:00:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 46 states have (on average 2.0) internal successors, (92), 82 states have internal predecessors, (92), 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 04:00:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:00:15,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:15,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:00:15,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:15,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:15,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-28 04:00:15,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:15,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663394129] [2024-11-28 04:00:15,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:15,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:15,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:15,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:15,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:00:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:15,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:00:15,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:15,418 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 7 [2024-11-28 04:00:15,453 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 04:00:15,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:00:15,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:15,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663394129] [2024-11-28 04:00:15,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663394129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:15,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:15,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:00:15,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537826335] [2024-11-28 04:00:15,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:15,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:00:15,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:15,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:00:15,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:00:15,495 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 2.0) internal successors, (92), 82 states have internal predecessors, (92), 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 04:00:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:15,771 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2024-11-28 04:00:15,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:00:15,775 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 04:00:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:15,783 INFO L225 Difference]: With dead ends: 79 [2024-11-28 04:00:15,783 INFO L226 Difference]: Without dead ends: 73 [2024-11-28 04:00:15,785 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 04:00:15,790 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:15,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 96 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:00:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-28 04:00:15,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-28 04:00:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 72 states have internal predecessors, (76), 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 04:00:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-11-28 04:00:15,840 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 4 [2024-11-28 04:00:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:15,841 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-11-28 04:00:15,841 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 04:00:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-11-28 04:00:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:00:15,842 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:15,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:00:15,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:00:16,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:16,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:16,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:16,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-28 04:00:16,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:16,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107780998] [2024-11-28 04:00:16,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:16,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:16,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:16,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:16,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:00:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:16,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 04:00:16,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:16,159 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 04:00:16,185 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 04:00:16,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:00:16,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107780998] [2024-11-28 04:00:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107780998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:16,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:16,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:00:16,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80243573] [2024-11-28 04:00:16,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:16,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:00:16,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:16,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:00:16,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:00:16,189 INFO L87 Difference]: Start difference. First operand 73 states and 76 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 04:00:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:16,411 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-28 04:00:16,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:00:16,412 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 04:00:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:16,413 INFO L225 Difference]: With dead ends: 69 [2024-11-28 04:00:16,413 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 04:00:16,414 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 04:00:16,415 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:16,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:00:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 04:00:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-28 04:00:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 68 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 04:00:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-28 04:00:16,428 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 4 [2024-11-28 04:00:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:16,428 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-28 04:00:16,429 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 04:00:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-28 04:00:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:00:16,429 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:16,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:16,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 04:00:16,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:16,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:16,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:16,631 INFO L85 PathProgramCache]: Analyzing trace with hash -401980876, now seen corresponding path program 1 times [2024-11-28 04:00:16,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:16,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254719407] [2024-11-28 04:00:16,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:16,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:16,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:16,634 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:16,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:00:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:16,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:00:16,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:16,813 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 04:00:16,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:00:16,813 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:16,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254719407] [2024-11-28 04:00:16,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254719407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:16,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:16,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:00:16,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414541369] [2024-11-28 04:00:16,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:16,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:00:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:16,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:00:16,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:00:16,817 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 04:00:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:17,142 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2024-11-28 04:00:17,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:00:17,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 04:00:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:17,144 INFO L225 Difference]: With dead ends: 81 [2024-11-28 04:00:17,144 INFO L226 Difference]: Without dead ends: 81 [2024-11-28 04:00:17,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:00:17,145 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 40 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:17,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 115 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:00:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-28 04:00:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-11-28 04:00:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.74) internal successors, (87), 76 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 04:00:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-11-28 04:00:17,152 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 10 [2024-11-28 04:00:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:17,152 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-11-28 04:00:17,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 04:00:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-11-28 04:00:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:00:17,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:17,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:17,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:00:17,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:17,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:17,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash -401980875, now seen corresponding path program 1 times [2024-11-28 04:00:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:17,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130982028] [2024-11-28 04:00:17,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:17,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:17,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:17,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:17,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:00:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:17,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 04:00:17,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:17,485 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 04:00:17,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:00:17,485 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:17,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130982028] [2024-11-28 04:00:17,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130982028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:17,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:17,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:00:17,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658649721] [2024-11-28 04:00:17,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:17,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:00:17,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:17,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:00:17,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:00:17,487 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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 04:00:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:17,503 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-11-28 04:00:17,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:00:17,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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 04:00:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:17,504 INFO L225 Difference]: With dead ends: 81 [2024-11-28 04:00:17,504 INFO L226 Difference]: Without dead ends: 81 [2024-11-28 04:00:17,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 04:00:17,505 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 132 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 04:00:17,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:00:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-28 04:00:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2024-11-28 04:00:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 74 states have internal predecessors, (83), 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 04:00:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2024-11-28 04:00:17,525 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 10 [2024-11-28 04:00:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:17,525 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2024-11-28 04:00:17,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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 04:00:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-28 04:00:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:00:17,526 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:17,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:17,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:00:17,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:17,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:17,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:17,728 INFO L85 PathProgramCache]: Analyzing trace with hash 423414423, now seen corresponding path program 1 times [2024-11-28 04:00:17,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:17,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834688321] [2024-11-28 04:00:17,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:17,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:17,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:17,730 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:17,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:00:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:17,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:00:17,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:17,841 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 7 [2024-11-28 04:00:17,852 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 04:00:17,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:00:17,853 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:17,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834688321] [2024-11-28 04:00:17,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834688321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:17,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:17,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:00:17,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376201621] [2024-11-28 04:00:17,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:17,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:00:17,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:17,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:00:17,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:00:17,854 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 04:00:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:18,018 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-11-28 04:00:18,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:00:18,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 04:00:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:18,020 INFO L225 Difference]: With dead ends: 73 [2024-11-28 04:00:18,023 INFO L226 Difference]: Without dead ends: 73 [2024-11-28 04:00:18,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 04:00:18,024 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:18,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 96 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:00:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-28 04:00:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-28 04:00:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 72 states have internal predecessors, (79), 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 04:00:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-11-28 04:00:18,032 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 11 [2024-11-28 04:00:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:18,032 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-11-28 04:00:18,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 04:00:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-11-28 04:00:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:00:18,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:18,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:18,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:18,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:18,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:18,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:18,238 INFO L85 PathProgramCache]: Analyzing trace with hash 423414424, now seen corresponding path program 1 times [2024-11-28 04:00:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318177506] [2024-11-28 04:00:18,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:18,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:18,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:18,241 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:18,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:00:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:18,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 04:00:18,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:18,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 04:00:18,356 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 04:00:18,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:00:18,356 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:18,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318177506] [2024-11-28 04:00:18,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318177506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:18,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:18,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:00:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426032208] [2024-11-28 04:00:18,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:18,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:00:18,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:18,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:00:18,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:00:18,358 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 04:00:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:18,512 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-28 04:00:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:00:18,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 04:00:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:18,513 INFO L225 Difference]: With dead ends: 71 [2024-11-28 04:00:18,513 INFO L226 Difference]: Without dead ends: 71 [2024-11-28 04:00:18,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 04:00:18,515 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:18,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 99 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:00:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-28 04:00:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-28 04:00:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.5625) internal successors, (75), 70 states have internal predecessors, (75), 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 04:00:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-28 04:00:18,526 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 11 [2024-11-28 04:00:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:18,526 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-28 04:00:18,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 04:00:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-28 04:00:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 04:00:18,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:18,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:18,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:18,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:18,727 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:18,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:18,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1120632133, now seen corresponding path program 1 times [2024-11-28 04:00:18,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:18,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1422414861] [2024-11-28 04:00:18,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:18,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:18,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:18,732 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:18,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:00:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:18,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 04:00:18,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:18,866 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 04:00:19,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:00:19,072 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 04:00:19,092 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:00:19,092 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 13 [2024-11-28 04:00:19,145 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 04:00:19,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:00:19,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:19,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422414861] [2024-11-28 04:00:19,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422414861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:19,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:19,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:00:19,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527151548] [2024-11-28 04:00:19,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:19,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:00:19,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:19,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:00:19,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:00:19,148 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 04:00:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:19,542 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-28 04:00:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:00:19,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2024-11-28 04:00:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:19,543 INFO L225 Difference]: With dead ends: 71 [2024-11-28 04:00:19,543 INFO L226 Difference]: Without dead ends: 71 [2024-11-28 04:00:19,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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 04:00:19,544 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 40 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:19,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 143 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 04:00:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-28 04:00:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-28 04:00:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 70 states have internal predecessors, (74), 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 04:00:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-28 04:00:19,549 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 13 [2024-11-28 04:00:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:19,549 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-28 04:00:19,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 04:00:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-28 04:00:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 04:00:19,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:19,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:19,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:19,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:19,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:19,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash 896150570, now seen corresponding path program 1 times [2024-11-28 04:00:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:19,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1111733235] [2024-11-28 04:00:19,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:19,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:19,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:19,754 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:19,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:00:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:19,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:00:19,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:00:19,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:00:19,898 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:19,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111733235] [2024-11-28 04:00:19,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111733235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:19,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:19,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:00:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464580608] [2024-11-28 04:00:19,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:19,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:00:19,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:19,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:00:19,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:00:19,900 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:00:20,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:20,145 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-28 04:00:20,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:00:20,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-28 04:00:20,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:20,146 INFO L225 Difference]: With dead ends: 69 [2024-11-28 04:00:20,146 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 04:00:20,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:00:20,147 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:20,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:00:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 04:00:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-28 04:00:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.5) internal successors, (72), 68 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 04:00:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-28 04:00:20,152 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 17 [2024-11-28 04:00:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:20,152 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-28 04:00:20,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:00:20,152 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-28 04:00:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 04:00:20,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:20,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:20,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 04:00:20,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:20,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:20,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:20,354 INFO L85 PathProgramCache]: Analyzing trace with hash 896150571, now seen corresponding path program 1 times [2024-11-28 04:00:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:20,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698040244] [2024-11-28 04:00:20,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:20,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:20,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:20,356 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:20,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:00:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:20,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:00:20,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:20,502 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 04:00:20,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:20,615 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 04:00:20,615 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:20,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698040244] [2024-11-28 04:00:20,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698040244] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:20,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:00:20,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-28 04:00:20,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313999503] [2024-11-28 04:00:20,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:20,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:00:20,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:20,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:00:20,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:00:20,620 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 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 04:00:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:20,667 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-28 04:00:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:00:20,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 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 17 [2024-11-28 04:00:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:20,669 INFO L225 Difference]: With dead ends: 87 [2024-11-28 04:00:20,669 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 04:00:20,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:00:20,670 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:20,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 242 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:00:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 04:00:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-28 04:00:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.40625) 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 04:00:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-28 04:00:20,682 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 17 [2024-11-28 04:00:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:20,682 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-28 04:00:20,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 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 04:00:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-28 04:00:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 04:00:20,683 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:20,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:20,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 04:00:20,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:20,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:20,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash -372257531, now seen corresponding path program 1 times [2024-11-28 04:00:20,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:20,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700237533] [2024-11-28 04:00:20,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:20,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:20,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:20,888 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:20,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:00:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:21,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 04:00:21,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:21,030 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 04:00:21,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:00:21,171 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 04:00:21,187 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:00:21,187 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 13 [2024-11-28 04:00:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:00:21,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:25,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:25,804 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 41 treesize of output 65 [2024-11-28 04:00:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:00:26,028 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:26,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700237533] [2024-11-28 04:00:26,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700237533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:26,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:00:26,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-28 04:00:26,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636910841] [2024-11-28 04:00:26,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:26,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:00:26,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:26,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:00:26,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2024-11-28 04:00:26,030 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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 04:00:27,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:27,117 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-28 04:00:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:00:27,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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 20 [2024-11-28 04:00:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:27,118 INFO L225 Difference]: With dead ends: 83 [2024-11-28 04:00:27,118 INFO L226 Difference]: Without dead ends: 83 [2024-11-28 04:00:27,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=35, Invalid=74, Unknown=1, NotChecked=0, Total=110 [2024-11-28 04:00:27,119 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 8 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:27,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 234 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 04:00:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-28 04:00:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-28 04:00:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.34375) internal successors, (86), 82 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 04:00:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2024-11-28 04:00:27,124 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 20 [2024-11-28 04:00:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:27,125 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-11-28 04:00:27,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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 04:00:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2024-11-28 04:00:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 04:00:27,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:27,126 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:27,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:27,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:27,329 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:27,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:27,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1339800399, now seen corresponding path program 1 times [2024-11-28 04:00:27,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:27,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098927459] [2024-11-28 04:00:27,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:27,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:27,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:27,333 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:27,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:00:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:27,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 04:00:27,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:27,528 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 7 [2024-11-28 04:00:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-28 04:00:27,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:00:27,611 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098927459] [2024-11-28 04:00:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098927459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:27,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:27,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:00:27,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064559473] [2024-11-28 04:00:27,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:27,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:00:27,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:27,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:00:27,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:00:27,613 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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 04:00:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:28,316 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-28 04:00:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:00:28,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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 41 [2024-11-28 04:00:28,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:28,319 INFO L225 Difference]: With dead ends: 80 [2024-11-28 04:00:28,320 INFO L226 Difference]: Without dead ends: 80 [2024-11-28 04:00:28,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:00:28,322 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 18 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:28,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 128 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 04:00:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-28 04:00:28,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-28 04:00:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 79 states have internal predecessors, (84), 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 04:00:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-28 04:00:28,330 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 41 [2024-11-28 04:00:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:28,330 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-28 04:00:28,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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 04:00:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-28 04:00:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 04:00:28,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:28,336 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:28,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:28,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:28,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:28,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1339800400, now seen corresponding path program 1 times [2024-11-28 04:00:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:28,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487897623] [2024-11-28 04:00:28,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:28,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:28,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:28,539 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:28,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:00:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:28,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 04:00:28,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:28,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:00:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-28 04:00:28,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:00:28,938 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:28,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487897623] [2024-11-28 04:00:28,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487897623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:28,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:28,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:00:28,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781195667] [2024-11-28 04:00:28,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:28,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:00:28,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:28,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:00:28,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:00:28,939 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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 04:00:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:29,586 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-28 04:00:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:00:29,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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 41 [2024-11-28 04:00:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:29,588 INFO L225 Difference]: With dead ends: 87 [2024-11-28 04:00:29,588 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 04:00:29,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:00:29,589 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:29,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 160 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 04:00:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 04:00:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-11-28 04:00:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 82 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 04:00:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-11-28 04:00:29,593 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 41 [2024-11-28 04:00:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:29,593 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-11-28 04:00:29,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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 04:00:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-11-28 04:00:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 04:00:29,594 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:29,595 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:29,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 04:00:29,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:29,795 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:29,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash 972300203, now seen corresponding path program 1 times [2024-11-28 04:00:29,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:29,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [430168195] [2024-11-28 04:00:29,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:29,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:29,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:29,798 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:29,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 04:00:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:30,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 04:00:30,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:30,414 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:00:30,415 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 13 [2024-11-28 04:00:30,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:00:30,598 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 04:00:30,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:00:30,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:00:30,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:00:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-28 04:00:30,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:31,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_629 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_629 .cse0))))))) is different from false [2024-11-28 04:00:31,159 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_629 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_629 .cse0))))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_629) |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 04:00:31,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_628))) (or (not (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_629 .cse1))) v_ArrVal_629)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_629) |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 04:00:31,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:31,262 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 48 treesize of output 40 [2024-11-28 04:00:31,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:31,298 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 98 treesize of output 100 [2024-11-28 04:00:34,877 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-28 04:00:34,877 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 75 [2024-11-28 04:00:34,948 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 13 treesize of output 1 [2024-11-28 04:00:35,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:35,092 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 28 treesize of output 32 [2024-11-28 04:00:35,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:35,206 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 48 treesize of output 52 [2024-11-28 04:00:35,302 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 39 treesize of output 33 [2024-11-28 04:00:35,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:35,800 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 33 treesize of output 57 [2024-11-28 04:00:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 10 not checked. [2024-11-28 04:00:36,091 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:36,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430168195] [2024-11-28 04:00:36,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430168195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:36,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:00:36,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-11-28 04:00:36,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586208827] [2024-11-28 04:00:36,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:36,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 04:00:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:36,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 04:00:36,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=330, Unknown=3, NotChecked=114, Total=506 [2024-11-28 04:00:36,094 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 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 04:00:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:37,984 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-28 04:00:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:00:37,985 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 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 45 [2024-11-28 04:00:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:37,986 INFO L225 Difference]: With dead ends: 83 [2024-11-28 04:00:37,986 INFO L226 Difference]: Without dead ends: 83 [2024-11-28 04:00:37,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=139, Invalid=572, Unknown=3, NotChecked=156, Total=870 [2024-11-28 04:00:37,987 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:37,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 592 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 362 Invalid, 0 Unknown, 114 Unchecked, 1.4s Time] [2024-11-28 04:00:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-28 04:00:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-28 04:00:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 82 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 04:00:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2024-11-28 04:00:37,991 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 45 [2024-11-28 04:00:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:37,991 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-11-28 04:00:37,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 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 04:00:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2024-11-28 04:00:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 04:00:37,992 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:37,992 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:38,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 04:00:38,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:38,193 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:38,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1919567614, now seen corresponding path program 1 times [2024-11-28 04:00:38,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:38,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440621549] [2024-11-28 04:00:38,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:38,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:38,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:38,196 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:38,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 04:00:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:38,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 04:00:38,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:38,598 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:00:38,598 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 13 [2024-11-28 04:00:38,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:00:38,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:00:38,781 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:00:38,782 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 36 treesize of output 35 [2024-11-28 04:00:38,951 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-28 04:00:38,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2024-11-28 04:00:39,126 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:00:39,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 60 [2024-11-28 04:00:39,667 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:00:39,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 60 [2024-11-28 04:00:39,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:39,762 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 69 treesize of output 57 [2024-11-28 04:00:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-28 04:00:40,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:40,661 INFO L349 Elim1Store]: treesize reduction 24, result has 68.0 percent of original size [2024-11-28 04:00:40,661 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 46 treesize of output 68 [2024-11-28 04:00:40,706 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_752)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) is different from false [2024-11-28 04:00:40,764 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_752)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (not (= v_ArrVal_751 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_751 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) is different from false [2024-11-28 04:00:40,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:40,794 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 661 treesize of output 659 [2024-11-28 04:00:40,813 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 173 treesize of output 153 [2024-11-28 04:00:40,852 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:00:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2024-11-28 04:00:41,074 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:41,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440621549] [2024-11-28 04:00:41,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440621549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:41,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:00:41,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2024-11-28 04:00:41,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343357655] [2024-11-28 04:00:41,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:41,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 04:00:41,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:41,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 04:00:41,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=486, Unknown=2, NotChecked=90, Total=650 [2024-11-28 04:00:41,077 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 26 states, 25 states have (on average 2.92) internal successors, (73), 26 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 04:00:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:44,756 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-11-28 04:00:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 04:00:44,757 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.92) internal successors, (73), 26 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 47 [2024-11-28 04:00:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:44,758 INFO L225 Difference]: With dead ends: 87 [2024-11-28 04:00:44,758 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 04:00:44,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=193, Invalid=935, Unknown=2, NotChecked=130, Total=1260 [2024-11-28 04:00:44,759 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 27 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:44,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 380 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 717 Invalid, 0 Unknown, 122 Unchecked, 2.6s Time] [2024-11-28 04:00:44,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 04:00:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-28 04:00:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 86 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 04:00:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-11-28 04:00:44,763 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 47 [2024-11-28 04:00:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:44,763 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-11-28 04:00:44,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.92) internal successors, (73), 26 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 04:00:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-11-28 04:00:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 04:00:44,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:44,768 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:44,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:44,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:44,969 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:00:44,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1919567613, now seen corresponding path program 1 times [2024-11-28 04:00:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:00:44,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1660279705] [2024-11-28 04:00:44,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:44,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:44,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:44,973 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:44,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 04:00:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:45,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-28 04:00:45,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:45,283 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-28 04:00:45,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-28 04:00:45,430 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2024-11-28 04:00:45,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 41 [2024-11-28 04:00:45,471 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 04:00:45,787 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:00:45,788 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 04:00:45,842 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2024-11-28 04:00:45,842 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 20 treesize of output 22 [2024-11-28 04:00:45,915 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 04:00:45,926 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 04:00:46,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:00:46,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:00:46,082 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:00:46,082 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 50 treesize of output 45 [2024-11-28 04:00:46,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 04:00:46,269 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 04:00:46,285 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 04:00:46,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 04:00:46,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:00:46,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:00:46,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 04:00:46,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 04:00:46,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 04:00:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:00:46,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:47,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_889) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_888) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_889) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) is different from false [2024-11-28 04:00:48,409 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_885 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_885 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_885 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_884 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_884) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_887) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_889) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_885) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_888) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))) (not (= v_ArrVal_884 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_884 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) (forall ((v_ArrVal_884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse2 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_884) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_887) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_889) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))) (not (= v_ArrVal_884 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_884 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) is different from false [2024-11-28 04:00:48,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 292 [2024-11-28 04:00:48,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 406 treesize of output 404 [2024-11-28 04:00:48,458 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 40 treesize of output 32 [2024-11-28 04:00:48,464 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 24 [2024-11-28 04:00:48,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-11-28 04:00:48,504 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 37 treesize of output 33 [2024-11-28 04:00:48,547 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 98 treesize of output 96 [2024-11-28 04:00:48,558 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 82 treesize of output 66 [2024-11-28 04:00:48,582 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 24 [2024-11-28 04:00:58,423 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-28 04:00:58,424 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 16 treesize of output 15 [2024-11-28 04:00:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-28 04:00:58,441 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:00:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660279705] [2024-11-28 04:00:58,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660279705] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:58,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:00:58,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2024-11-28 04:00:58,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261860847] [2024-11-28 04:00:58,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:58,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 04:00:58,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:00:58,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 04:00:58,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=813, Unknown=16, NotChecked=118, Total=1056 [2024-11-28 04:00:58,443 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 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 04:01:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:01:04,376 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-28 04:01:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 04:01:04,377 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 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 47 [2024-11-28 04:01:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:01:04,378 INFO L225 Difference]: With dead ends: 93 [2024-11-28 04:01:04,378 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 04:01:04,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=243, Invalid=1309, Unknown=16, NotChecked=154, Total=1722 [2024-11-28 04:01:04,380 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 61 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:01:04,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 467 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 805 Invalid, 0 Unknown, 138 Unchecked, 3.8s Time] [2024-11-28 04:01:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 04:01:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-28 04:01:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.2533333333333334) 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 04:01:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-28 04:01:04,383 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 47 [2024-11-28 04:01:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:01:04,384 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-28 04:01:04,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 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 04:01:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-28 04:01:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 04:01:04,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:01:04,385 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:04,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-28 04:01:04,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:04,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:01:04,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:04,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2131544921, now seen corresponding path program 1 times [2024-11-28 04:01:04,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:01:04,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32079934] [2024-11-28 04:01:04,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:04,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:04,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:01:04,588 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:01:04,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 04:01:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:04,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:01:04,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:01:04,787 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 7 [2024-11-28 04:01:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-28 04:01:04,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:01:04,894 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:01:04,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32079934] [2024-11-28 04:01:04,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32079934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:04,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:04,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:01:04,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805684040] [2024-11-28 04:01:04,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:04,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:01:04,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:01:04,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:01:04,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:01:04,895 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:01:05,356 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-28 04:01:05,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:01:05,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-28 04:01:05,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:01:05,357 INFO L225 Difference]: With dead ends: 92 [2024-11-28 04:01:05,357 INFO L226 Difference]: Without dead ends: 92 [2024-11-28 04:01:05,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:01:05,358 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:01:05,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 04:01:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-28 04:01:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-11-28 04:01:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.24) 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 04:01:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-28 04:01:05,362 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 49 [2024-11-28 04:01:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:01:05,362 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-28 04:01:05,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-28 04:01:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 04:01:05,363 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:01:05,364 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:05,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 04:01:05,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:05,564 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:01:05,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2131544922, now seen corresponding path program 1 times [2024-11-28 04:01:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:01:05,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030063373] [2024-11-28 04:01:05,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:05,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:05,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:01:05,569 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:01:05,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 04:01:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:05,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 04:01:05,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:01:05,775 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 04:01:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-28 04:01:05,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:01:05,958 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:01:05,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030063373] [2024-11-28 04:01:05,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030063373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:05,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:05,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:01:05,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392014102] [2024-11-28 04:01:05,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:05,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:01:05,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:01:05,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:01:05,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:01:05,959 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:01:06,443 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-28 04:01:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:01:06,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-28 04:01:06,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:01:06,444 INFO L225 Difference]: With dead ends: 91 [2024-11-28 04:01:06,444 INFO L226 Difference]: Without dead ends: 91 [2024-11-28 04:01:06,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:01:06,445 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:01:06,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:01:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-28 04:01:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-28 04:01:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.2266666666666666) 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 04:01:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-28 04:01:06,449 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 49 [2024-11-28 04:01:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:01:06,449 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-28 04:01:06,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-28 04:01:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 04:01:06,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:01:06,450 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:06,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 04:01:06,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:06,651 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-28 04:01:06,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:06,651 INFO L85 PathProgramCache]: Analyzing trace with hash -364770338, now seen corresponding path program 1 times [2024-11-28 04:01:06,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:01:06,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598929442] [2024-11-28 04:01:06,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:06,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:06,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:01:06,653 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:01:06,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854cf018-a55d-493a-95e3-a2e7946899a3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 04:01:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:06,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-28 04:01:06,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:01:07,178 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-28 04:01:07,178 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 21 treesize of output 20 [2024-11-28 04:01:07,524 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-28 04:01:07,524 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 20 treesize of output 22 [2024-11-28 04:01:07,765 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 04:01:07,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:01:08,069 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:01:08,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:01:08,190 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 04:01:08,225 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 04:01:08,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:01:08,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:01:08,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:01:08,388 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 04:01:08,460 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:01:08,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2024-11-28 04:01:08,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 04:01:08,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-28 04:01:08,735 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-28 04:01:08,735 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 39 treesize of output 34 [2024-11-28 04:01:08,766 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 04:01:08,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 04:01:08,779 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 04:01:09,069 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:01:09,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 57 [2024-11-28 04:01:09,192 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2024-11-28 04:01:09,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 81 [2024-11-28 04:01:09,207 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:01:09,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 68 [2024-11-28 04:01:10,043 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:01:10,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 57 [2024-11-28 04:01:10,063 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:01:10,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 76 [2024-11-28 04:01:10,176 INFO L349 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2024-11-28 04:01:10,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 88 [2024-11-28 04:01:10,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:10,528 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 70 treesize of output 54 [2024-11-28 04:01:10,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:10,551 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 50 treesize of output 50 [2024-11-28 04:01:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:01:11,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:01:11,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:11,995 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2024-11-28 04:01:12,009 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse0 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_3) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)))) (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (_ bv1 32))))) is different from false [2024-11-28 04:01:12,903 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1264))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1265))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)))))) is different from false [2024-11-28 04:01:13,661 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1262 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1262)) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1264))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1262) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1265))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)))) (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32))) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1261 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1261)))) is different from false [2024-11-28 04:01:14,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:14,193 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 1702 treesize of output 1704 [2024-11-28 04:01:14,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:14,299 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 6438 treesize of output 6412 [2024-11-28 04:01:14,340 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 436 treesize of output 420 [2024-11-28 04:01:14,355 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 502 treesize of output 478 [2024-11-28 04:01:14,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:14,599 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2024-11-28 04:01:14,654 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 23 [2024-11-28 04:01:15,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:15,408 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-28 04:01:15,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:15,436 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-28 04:01:15,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:15,459 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2024-11-28 04:01:15,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:15,637 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-28 04:01:16,154 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 04:01:16,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 04:01:16,603 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse9 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse11 (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse2 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (.cse12 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (or .cse11 .cse12)) (.cse8 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_ArrVal_1267 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_1263 .cse2 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32)))))) (.cse10 (not .cse12)) (.cse7 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (and (= |c_ULTIMATE.start_main_~data_init~0#1| (_ bv1 32)) .cse9)) (.cse4 (not .cse9)) (.cse6 (not .cse1))) (and (or .cse0 .cse1 (and (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_ArrVal_1267 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_1263 .cse2 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) .cse3)) (or (and (or .cse0 .cse1 (and .cse4 (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32))) (forall ((v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_114 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse2 v_arrayElimCell_114)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (or .cse0 (and (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse2 (select v_arrayElimArr_4 .cse2))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))))) (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32))))) (or .cse6 (and .cse4 (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))) (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32)))))))))) (not .cse7)) (or .cse0 .cse8) (or (and .cse3 (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_1263 .cse2 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))))) (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32)))))) .cse7) (or .cse9 .cse6 .cse8) (or .cse1 (and (or .cse10 (and (or .cse0 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse2 (select v_arrayElimArr_8 .cse2))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or .cse7 .cse8) (or (and .cse9 .cse7) .cse11 .cse12))) (or .cse10 (and (or .cse0 (let ((.cse13 (forall ((v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_45 (_ BitVec 32)) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_46 (_ BitVec 32))) (or (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_prenex_46) v_prenex_45) |c_ULTIMATE.start_main_~data_init~0#1|))))) (and (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_45 (_ BitVec 32)) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_46 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_prenex_46) v_prenex_45) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse2 (select v_arrayElimArr_7 .cse2))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32))))) (or .cse6 .cse13) (or .cse4 .cse13)))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)))) .cse7) (or .cse0 .cse1 (and (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse2 (select v_arrayElimArr_7 .cse2))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32))))) (or .cse4 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)) (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32)))))))) (or .cse9 .cse6 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)) (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv1 32)))))))))))) is different from false [2024-11-28 04:01:23,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse2 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse8 (= (_ bv0 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse4 (not .cse8)) (.cse5 (not .cse2)) (.cse6 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse10 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_ArrVal_1267 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32)) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_1263 .cse1 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))))) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse3 (and (= |c_ULTIMATE.start_main_~data_init~0#1| (_ bv1 32)) .cse8))) (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32))) (or (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (and (or .cse2 .cse3 (and .cse4 (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 .cse1 v_arrayElimCell_114)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (or (and (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 .cse1 (select v_arrayElimArr_4 .cse1))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (or .cse5 (and .cse4 (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)))))))) .cse3)) (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (or .cse6 (let ((.cse7 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)))))) (and (or .cse7 .cse8 .cse5) (or .cse7 .cse2) (or (let ((.cse9 (forall ((v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_prenex_46) v_prenex_45) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))))))) (and (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_prenex_46) v_prenex_45) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (or .cse9 .cse4) (or .cse9 .cse5))) .cse3) (or .cse2 .cse3 (and (or .cse7 .cse4) (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))))) (or .cse8 .cse10 .cse5) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_1263 .cse1 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (or (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_ArrVal_1267 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_1263 .cse1 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)))))) (or .cse8 (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or .cse6 (and (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) .cse3)))) .cse2) (or .cse10 .cse3) (or (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_ArrVal_1267 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |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_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_1263 .cse1 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32))) (or (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse2 .cse3)))) is different from false [2024-11-28 04:01:23,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse10 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse4 (= (_ bv0 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse6 (not .cse4)) (.cse2 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse1 (and (= |c_ULTIMATE.start_main_~data_init~0#1| (_ bv1 32)) .cse4)) (.cse0 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_ArrVal_1267 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32)) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store .cse19 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse19 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |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_main_~data_init~0#1| (select (select (store (store (store .cse19 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_1263 .cse10 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)))))) (.cse5 (not .cse7))) (and (or .cse0 .cse1) (or .cse2 (let ((.cse3 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))))))) (and (or .cse3 .cse4 .cse5) (or (and (forall ((v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse3 .cse6)) .cse7 .cse1) (or .cse1 (let ((.cse8 (forall ((v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_prenex_46) v_prenex_45)))))) (and (forall ((v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_45 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_prenex_46) v_prenex_45))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (or .cse6 .cse8) (or .cse8 .cse5)))) (or .cse3 .cse7)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32)) (v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_1263 .cse10 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse9 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))))) (or .cse7 .cse1 (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32)) (v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_ArrVal_1267 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |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_main_~data_init~0#1| (select (select (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_1263 .cse10 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32)) (v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256))) (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 v_ArrVal_1267))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (or (and (or .cse5 (and .cse6 (forall ((v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))))))) (forall ((v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 (select v_arrayElimArr_4 .cse10))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) .cse1) (or .cse7 .cse1 (and .cse6 (forall ((v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256))) (store .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 v_arrayElimCell_114))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32)) (v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256))) (store .cse15 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 v_ArrVal_1267))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32)) (v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_ArrVal_1267 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store .cse16 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse16 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |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_main_~data_init~0#1| (select (select (store (store (store .cse16 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_1263 .cse10 v_ArrVal_1267)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))))))) (forall ((v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256))) (store .cse17 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 v_ArrVal_1267))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |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_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or .cse4 (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256))) (store .cse18 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse18 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 v_ArrVal_1267))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimArr_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or .cse2 (and (forall ((v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse1 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1256 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) .cse7) (or .cse4 .cse0 .cse5)))) is different from false [2024-11-28 04:01:24,969 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 04:01:24,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1063 treesize of output 1065 [2024-11-28 04:01:25,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:25,030 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 262 treesize of output 260 [2024-11-28 04:01:25,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:25,134 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 291 treesize of output 293 [2024-11-28 04:01:25,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:25,214 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 97 treesize of output 96 [2024-11-28 04:01:25,245 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 136 treesize of output 132 [2024-11-28 04:01:25,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:25,293 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 138 treesize of output 142 [2024-11-28 04:01:27,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:01:27,518 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 1017 treesize of output 1001 [2024-11-28 04:01:27,551 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 148 treesize of output 144 [2024-11-28 04:01:27,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:27,584 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 268 treesize of output 266 [2024-11-28 04:01:27,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:27,675 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 265 treesize of output 269 [2024-11-28 04:01:27,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 101 treesize of output 99 [2024-11-28 04:01:28,122 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 04:01:28,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1063 treesize of output 1065 [2024-11-28 04:01:28,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:28,189 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 262 treesize of output 260 [2024-11-28 04:01:28,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:28,322 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 291 treesize of output 293 [2024-11-28 04:01:28,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:28,410 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 97 treesize of output 96 [2024-11-28 04:01:28,449 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 136 treesize of output 132 [2024-11-28 04:01:28,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:28,500 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 138 treesize of output 142 [2024-11-28 04:01:29,701 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:01:29,715 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 234 treesize of output 226 [2024-11-28 04:01:29,729 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 53 treesize of output 51 [2024-11-28 04:01:29,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:29,765 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 112 treesize of output 110 [2024-11-28 04:01:29,780 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 50 treesize of output 46 [2024-11-28 04:01:29,889 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 234 treesize of output 226 [2024-11-28 04:01:29,900 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 108 treesize of output 104 [2024-11-28 04:01:29,912 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 52 treesize of output 50 [2024-11-28 04:01:29,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:29,938 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 108 treesize of output 106 [2024-11-28 04:01:30,020 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:30,021 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:30,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:30,034 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 18 treesize of output 19 [2024-11-28 04:01:30,054 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 30 treesize of output 22 [2024-11-28 04:01:30,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:01:30,081 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:30,083 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:30,260 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 04:01:30,261 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 2 case distinctions, treesize of input 1019 treesize of output 1021 [2024-11-28 04:01:30,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 238 treesize of output 230 [2024-11-28 04:01:30,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:30,345 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 236 treesize of output 226 [2024-11-28 04:01:30,371 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:30,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:30,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2024-11-28 04:01:30,473 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 136 treesize of output 132 [2024-11-28 04:01:30,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:30,529 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 111 treesize of output 115 [2024-11-28 04:01:31,138 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:31,139 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:31,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:31,152 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 18 treesize of output 19 [2024-11-28 04:01:31,170 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 30 treesize of output 22 [2024-11-28 04:01:31,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:01:31,201 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:01:31,208 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:01:31,215 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:31,216 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:31,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:31,232 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 18 treesize of output 19 [2024-11-28 04:01:31,241 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 30 treesize of output 22 [2024-11-28 04:01:31,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:01:31,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:31,284 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:31,408 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 04:01:31,409 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 2 case distinctions, treesize of input 1019 treesize of output 1021 [2024-11-28 04:01:31,439 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 238 treesize of output 230 [2024-11-28 04:01:31,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:31,515 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 236 treesize of output 226 [2024-11-28 04:01:31,567 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:31,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:31,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2024-11-28 04:01:31,705 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 136 treesize of output 132 [2024-11-28 04:01:31,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:31,769 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 111 treesize of output 115 [2024-11-28 04:01:32,142 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:32,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:32,156 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 33 treesize of output 33 [2024-11-28 04:01:32,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:01:32,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-28 04:01:32,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:01:32,235 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:32,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:32,245 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 18 treesize of output 19 [2024-11-28 04:01:32,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-28 04:01:32,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:01:32,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:32,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:01:32,313 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2024-11-28 04:01:32,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 496 treesize of output 1 [2024-11-28 04:01:34,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:34,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 191 treesize of output 719 [2024-11-28 04:01:45,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:45,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 264 [2024-11-28 04:01:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2024-11-28 04:01:47,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:01:47,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598929442] [2024-11-28 04:01:47,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598929442] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:01:47,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:01:47,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 48 [2024-11-28 04:01:47,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988221817] [2024-11-28 04:01:47,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:01:47,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-28 04:01:47,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:01:47,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-28 04:01:47,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1558, Unknown=38, NotChecked=510, Total=2256 [2024-11-28 04:01:47,336 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 48 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 48 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 04:01:54,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:01:56,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]