./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/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_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC --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-6497de0 [2024-11-23 22:51:45,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 22:51:45,902 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-23 22:51:45,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 22:51:45,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 22:51:45,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 22:51:45,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 22:51:45,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 22:51:45,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 22:51:45,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 22:51:45,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 22:51:45,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 22:51:45,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 22:51:45,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 22:51:45,935 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 22:51:45,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 22:51:45,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 22:51:45,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 22:51:45,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 22:51:45,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 22:51:45,936 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-23 22:51:45,936 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-23 22:51:45,936 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-23 22:51:45,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 22:51:45,936 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 22:51:45,936 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 22:51:45,936 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 22:51:45,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 22:51:45,936 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 22:51:45,937 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 22:51:45,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 22:51:45,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 22:51:45,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 22:51:45,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:51:45,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 22:51:45,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 22:51:45,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 22:51:45,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 22:51:45,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:51:45,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 22:51:45,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 22:51:45,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 22:51:45,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 22:51:45,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 22:51:45,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 22:51:45,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 22:51:45,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 22:51:45,938 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_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC 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-23 22:51:46,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 22:51:46,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 22:51:46,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 22:51:46,284 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 22:51:46,285 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 22:51:46,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-23 22:51:49,172 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/data/e6c3997ac/1fade4998d22488e96dbe1d4db6ad73b/FLAG1f043f3f1 [2024-11-23 22:51:49,664 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 22:51:49,665 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-23 22:51:49,689 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/data/e6c3997ac/1fade4998d22488e96dbe1d4db6ad73b/FLAG1f043f3f1 [2024-11-23 22:51:49,708 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/data/e6c3997ac/1fade4998d22488e96dbe1d4db6ad73b [2024-11-23 22:51:49,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 22:51:49,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 22:51:49,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 22:51:49,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 22:51:49,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 22:51:49,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:51:49" (1/1) ... [2024-11-23 22:51:49,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad9b186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:49, skipping insertion in model container [2024-11-23 22:51:49,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:51:49" (1/1) ... [2024-11-23 22:51:49,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 22:51:50,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 22:51:50,164 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 22:51:50,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 22:51:50,245 INFO L204 MainTranslator]: Completed translation [2024-11-23 22:51:50,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50 WrapperNode [2024-11-23 22:51:50,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 22:51:50,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 22:51:50,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 22:51:50,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 22:51:50,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,302 INFO L138 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-11-23 22:51:50,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 22:51:50,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 22:51:50,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 22:51:50,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 22:51:50,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,341 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-23 22:51:50,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,354 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 22:51:50,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 22:51:50,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 22:51:50,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 22:51:50,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (1/1) ... [2024-11-23 22:51:50,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:51:50,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:51:50,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 22:51:50,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 22:51:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-23 22:51:50,438 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-23 22:51:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 22:51:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 22:51:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 22:51:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 22:51:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 22:51:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 22:51:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 22:51:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 22:51:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 22:51:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 22:51:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 22:51:50,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 22:51:50,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 22:51:50,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 22:51:50,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 22:51:50,573 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 22:51:50,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 22:51:50,600 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-23 22:51:50,974 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-23 22:51:50,975 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 22:51:50,992 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 22:51:50,992 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-23 22:51:50,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:51:50 BoogieIcfgContainer [2024-11-23 22:51:50,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 22:51:50,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 22:51:50,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 22:51:51,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 22:51:51,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:51:49" (1/3) ... [2024-11-23 22:51:51,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd982cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:51:51, skipping insertion in model container [2024-11-23 22:51:51,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:51:50" (2/3) ... [2024-11-23 22:51:51,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd982cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:51:51, skipping insertion in model container [2024-11-23 22:51:51,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:51:50" (3/3) ... [2024-11-23 22:51:51,002 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2024-11-23 22:51:51,014 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 22:51:51,016 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-23 22:51:51,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 22:51:51,067 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;@34b86756, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 22:51:51,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-23 22:51:51,071 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-23 22:51:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-23 22:51:51,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:51,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-23 22:51:51,081 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-23 22:51:51,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:51,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-23 22:51:51,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:51,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434162032] [2024-11-23 22:51:51,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:51,332 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-23 22:51:51,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:51,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434162032] [2024-11-23 22:51:51,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434162032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:51:51,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:51:51,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:51:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312527265] [2024-11-23 22:51:51,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:51:51,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:51:51,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:51,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:51:51,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:51:51,373 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-23 22:51:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:51:51,509 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2024-11-23 22:51:51,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:51:51,512 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-23 22:51:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:51:51,517 INFO L225 Difference]: With dead ends: 79 [2024-11-23 22:51:51,517 INFO L226 Difference]: Without dead ends: 73 [2024-11-23 22:51:51,519 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-23 22:51:51,522 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-23 22:51:51,523 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-23 22:51:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-23 22:51:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-23 22:51:51,552 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-23 22:51:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-11-23 22:51:51,557 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 4 [2024-11-23 22:51:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:51:51,558 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-11-23 22:51:51,558 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-23 22:51:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-11-23 22:51:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-23 22:51:51,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:51,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-23 22:51:51,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 22:51:51,559 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-23 22:51:51,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:51,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-23 22:51:51,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:51,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704541348] [2024-11-23 22:51:51,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:51,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:51,681 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-23 22:51:51,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:51,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704541348] [2024-11-23 22:51:51,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704541348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:51:51,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:51:51,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:51:51,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654590987] [2024-11-23 22:51:51,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:51:51,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:51:51,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:51,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:51:51,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:51:51,687 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-23 22:51:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:51:51,791 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-23 22:51:51,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:51:51,792 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-23 22:51:51,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:51:51,792 INFO L225 Difference]: With dead ends: 69 [2024-11-23 22:51:51,792 INFO L226 Difference]: Without dead ends: 69 [2024-11-23 22:51:51,793 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-23 22:51:51,793 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-23 22:51:51,794 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-23 22:51:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-23 22:51:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-23 22:51:51,798 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-23 22:51:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-23 22:51:51,799 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 4 [2024-11-23 22:51:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:51:51,799 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-23 22:51:51,800 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-23 22:51:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-23 22:51:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-23 22:51:51,800 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:51,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:51:51,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 22:51:51,800 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-23 22:51:51,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:51,801 INFO L85 PathProgramCache]: Analyzing trace with hash -401980876, now seen corresponding path program 1 times [2024-11-23 22:51:51,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:51,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217107274] [2024-11-23 22:51:51,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:51,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:51,937 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-23 22:51:51,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:51,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217107274] [2024-11-23 22:51:51,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217107274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:51:51,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:51:51,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 22:51:51,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655542549] [2024-11-23 22:51:51,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:51:51,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:51:51,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:51,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:51:51,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:51:51,939 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-23 22:51:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:51:51,953 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-23 22:51:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:51:51,954 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-23 22:51:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:51:51,955 INFO L225 Difference]: With dead ends: 82 [2024-11-23 22:51:51,955 INFO L226 Difference]: Without dead ends: 82 [2024-11-23 22:51:51,955 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-23 22:51:51,956 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-23 22:51:51,956 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-23 22:51:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-23 22:51:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2024-11-23 22:51:51,961 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-23 22:51:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-11-23 22:51:51,962 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 10 [2024-11-23 22:51:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:51:51,962 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-11-23 22:51:51,962 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-23 22:51:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-11-23 22:51:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 22:51:51,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:51,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:51:51,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 22:51:51,963 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-23 22:51:51,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:51,964 INFO L85 PathProgramCache]: Analyzing trace with hash 423414423, now seen corresponding path program 1 times [2024-11-23 22:51:51,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380795524] [2024-11-23 22:51:51,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:52,045 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-23 22:51:52,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:52,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380795524] [2024-11-23 22:51:52,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380795524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:51:52,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:51:52,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:51:52,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397065562] [2024-11-23 22:51:52,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:51:52,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:51:52,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:52,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:51:52,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:51:52,047 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-23 22:51:52,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:51:52,124 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-11-23 22:51:52,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:51:52,124 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-23 22:51:52,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:51:52,125 INFO L225 Difference]: With dead ends: 68 [2024-11-23 22:51:52,125 INFO L226 Difference]: Without dead ends: 68 [2024-11-23 22:51:52,125 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-23 22:51:52,126 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-23 22:51:52,127 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-23 22:51:52,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-23 22:51:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-23 22:51:52,135 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-23 22:51:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-11-23 22:51:52,140 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 11 [2024-11-23 22:51:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:51:52,140 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-11-23 22:51:52,140 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-23 22:51:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-11-23 22:51:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 22:51:52,141 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:52,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:51:52,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 22:51:52,141 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-23 22:51:52,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:52,142 INFO L85 PathProgramCache]: Analyzing trace with hash 423414424, now seen corresponding path program 1 times [2024-11-23 22:51:52,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:52,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559541168] [2024-11-23 22:51:52,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:52,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:52,298 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-23 22:51:52,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:52,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559541168] [2024-11-23 22:51:52,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559541168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:51:52,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:51:52,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:51:52,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109546464] [2024-11-23 22:51:52,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:51:52,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:51:52,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:52,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:51:52,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:51:52,300 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-23 22:51:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:51:52,377 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2024-11-23 22:51:52,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:51:52,378 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-23 22:51:52,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:51:52,379 INFO L225 Difference]: With dead ends: 66 [2024-11-23 22:51:52,379 INFO L226 Difference]: Without dead ends: 66 [2024-11-23 22:51:52,379 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-23 22:51:52,380 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-23 22:51:52,380 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-23 22:51:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-23 22:51:52,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-23 22:51:52,388 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-23 22:51:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-11-23 22:51:52,389 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 11 [2024-11-23 22:51:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:51:52,389 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-11-23 22:51:52,389 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-23 22:51:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-11-23 22:51:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-23 22:51:52,390 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:52,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:51:52,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 22:51:52,390 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-23 22:51:52,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:52,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1120632134, now seen corresponding path program 1 times [2024-11-23 22:51:52,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:52,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713266247] [2024-11-23 22:51:52,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:52,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:52,699 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-23 22:51:52,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:52,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713266247] [2024-11-23 22:51:52,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713266247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:51:52,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:51:52,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:51:52,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578835181] [2024-11-23 22:51:52,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:51:52,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 22:51:52,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:52,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 22:51:52,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 22:51:52,705 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-23 22:51:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:51:52,862 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-23 22:51:52,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 22:51:52,863 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-23 22:51:52,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:51:52,864 INFO L225 Difference]: With dead ends: 71 [2024-11-23 22:51:52,864 INFO L226 Difference]: Without dead ends: 71 [2024-11-23 22:51:52,864 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-23 22:51:52,865 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-23 22:51:52,865 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-23 22:51:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-23 22:51:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-23 22:51:52,873 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-23 22:51:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-23 22:51:52,874 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 13 [2024-11-23 22:51:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:51:52,874 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-23 22:51:52,874 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-23 22:51:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-23 22:51:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-23 22:51:52,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:52,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:51:52,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 22:51:52,875 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-23 22:51:52,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1120632133, now seen corresponding path program 1 times [2024-11-23 22:51:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:52,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113874024] [2024-11-23 22:51:52,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:53,208 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-23 22:51:53,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:53,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113874024] [2024-11-23 22:51:53,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113874024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:51:53,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:51:53,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 22:51:53,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887124044] [2024-11-23 22:51:53,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:51:53,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 22:51:53,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:53,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 22:51:53,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-23 22:51:53,209 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-23 22:51:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:51:53,341 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-23 22:51:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:51:53,342 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-23 22:51:53,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:51:53,343 INFO L225 Difference]: With dead ends: 71 [2024-11-23 22:51:53,343 INFO L226 Difference]: Without dead ends: 71 [2024-11-23 22:51:53,343 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-23 22:51:53,344 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-23 22:51:53,344 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-23 22:51:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-23 22:51:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-23 22:51:53,353 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-23 22:51:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-23 22:51:53,354 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 13 [2024-11-23 22:51:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:51:53,354 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-23 22:51:53,356 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-23 22:51:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-23 22:51:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-23 22:51:53,356 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:53,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:51:53,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 22:51:53,357 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-23 22:51:53,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:53,358 INFO L85 PathProgramCache]: Analyzing trace with hash 896150570, now seen corresponding path program 1 times [2024-11-23 22:51:53,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:53,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914082544] [2024-11-23 22:51:53,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:53,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:53,504 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-23 22:51:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:53,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914082544] [2024-11-23 22:51:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914082544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:51:53,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:51:53,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 22:51:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475970857] [2024-11-23 22:51:53,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:51:53,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:51:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:53,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:51:53,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:51:53,507 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-23 22:51:53,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:51:53,622 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-23 22:51:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 22:51:53,623 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-23 22:51:53,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:51:53,623 INFO L225 Difference]: With dead ends: 69 [2024-11-23 22:51:53,623 INFO L226 Difference]: Without dead ends: 69 [2024-11-23 22:51:53,623 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-23 22:51:53,624 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-23 22:51:53,624 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-23 22:51:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-23 22:51:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-23 22:51:53,632 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-23 22:51:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-23 22:51:53,637 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 17 [2024-11-23 22:51:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:51:53,637 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-23 22:51:53,637 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-23 22:51:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-23 22:51:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-23 22:51:53,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:53,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:51:53,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 22:51:53,638 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-23 22:51:53,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:53,639 INFO L85 PathProgramCache]: Analyzing trace with hash 896150571, now seen corresponding path program 1 times [2024-11-23 22:51:53,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:53,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676056460] [2024-11-23 22:51:53,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:53,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:53,793 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-23 22:51:53,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:53,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676056460] [2024-11-23 22:51:53,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676056460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:51:53,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234472334] [2024-11-23 22:51:53,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:53,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:51:53,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:51:53,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:51:53,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 22:51:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:53,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 22:51:53,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:51:53,994 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-23 22:51:53,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:51:54,060 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-23 22:51:54,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234472334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:51:54,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:51:54,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-23 22:51:54,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445479154] [2024-11-23 22:51:54,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:51:54,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 22:51:54,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:54,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 22:51:54,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-23 22:51:54,063 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-23 22:51:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:51:54,089 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-23 22:51:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 22:51:54,089 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-23 22:51:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:51:54,090 INFO L225 Difference]: With dead ends: 87 [2024-11-23 22:51:54,091 INFO L226 Difference]: Without dead ends: 87 [2024-11-23 22:51:54,091 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-23 22:51:54,092 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-23 22:51:54,093 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-23 22:51:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-23 22:51:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-23 22:51:54,099 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-23 22:51:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-23 22:51:54,100 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 17 [2024-11-23 22:51:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:51:54,100 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-23 22:51:54,100 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-23 22:51:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-23 22:51:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-23 22:51:54,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:54,101 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:51:54,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 22:51:54,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:51:54,305 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-23 22:51:54,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:54,306 INFO L85 PathProgramCache]: Analyzing trace with hash -372257531, now seen corresponding path program 1 times [2024-11-23 22:51:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:54,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006209121] [2024-11-23 22:51:54,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:54,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:54,572 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-23 22:51:54,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:54,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006209121] [2024-11-23 22:51:54,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006209121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:51:54,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611112412] [2024-11-23 22:51:54,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:54,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:51:54,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:51:54,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:51:54,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 22:51:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:54,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-23 22:51:54,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:51:54,755 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-23 22:51:54,849 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-23 22:51:54,850 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-23 22:51:54,900 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-23 22:51:54,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:51:55,113 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-23 22:51:55,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611112412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:51:55,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:51:55,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-11-23 22:51:55,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398924937] [2024-11-23 22:51:55,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:51:55,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:51:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:55,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:51:55,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:51:55,115 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-23 22:51:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:51:55,260 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-23 22:51:55,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 22:51:55,261 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-23 22:51:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:51:55,261 INFO L225 Difference]: With dead ends: 83 [2024-11-23 22:51:55,261 INFO L226 Difference]: Without dead ends: 83 [2024-11-23 22:51:55,262 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-23 22:51:55,262 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-23 22:51:55,263 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-23 22:51:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-23 22:51:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-23 22:51:55,266 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-23 22:51:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2024-11-23 22:51:55,267 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 20 [2024-11-23 22:51:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:51:55,267 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-11-23 22:51:55,267 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-23 22:51:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2024-11-23 22:51:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-23 22:51:55,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:55,268 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-23 22:51:55,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 22:51:55,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-23 22:51:55,469 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-23 22:51:55,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:55,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1339800399, now seen corresponding path program 1 times [2024-11-23 22:51:55,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:55,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551523192] [2024-11-23 22:51:55,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:55,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:55,728 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-23 22:51:55,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:55,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551523192] [2024-11-23 22:51:55,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551523192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:51:55,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:51:55,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 22:51:55,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616666602] [2024-11-23 22:51:55,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:51:55,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 22:51:55,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:55,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 22:51:55,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 22:51:55,734 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-23 22:51:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:51:55,914 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-23 22:51:55,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 22:51:55,915 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-23 22:51:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:51:55,915 INFO L225 Difference]: With dead ends: 80 [2024-11-23 22:51:55,918 INFO L226 Difference]: Without dead ends: 80 [2024-11-23 22:51:55,918 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-23 22:51:55,919 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-23 22:51:55,919 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-23 22:51:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-23 22:51:55,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-23 22:51:55,922 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-23 22:51:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-23 22:51:55,923 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 41 [2024-11-23 22:51:55,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:51:55,923 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-23 22:51:55,923 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-23 22:51:55,924 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-23 22:51:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-23 22:51:55,924 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:55,924 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-23 22:51:55,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 22:51:55,925 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-23 22:51:55,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:55,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1339800400, now seen corresponding path program 1 times [2024-11-23 22:51:55,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:55,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034258948] [2024-11-23 22:51:55,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:55,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:56,317 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-23 22:51:56,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:56,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034258948] [2024-11-23 22:51:56,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034258948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:51:56,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:51:56,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 22:51:56,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826178382] [2024-11-23 22:51:56,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:51:56,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:51:56,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:56,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:51:56,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:51:56,319 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-23 22:51:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:51:56,466 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-23 22:51:56,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 22:51:56,466 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-23 22:51:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:51:56,467 INFO L225 Difference]: With dead ends: 87 [2024-11-23 22:51:56,467 INFO L226 Difference]: Without dead ends: 87 [2024-11-23 22:51:56,467 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-23 22:51:56,468 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.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:51:56,468 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.1s Time] [2024-11-23 22:51:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-23 22:51:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-11-23 22:51:56,471 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-23 22:51:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-11-23 22:51:56,471 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 41 [2024-11-23 22:51:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:51:56,472 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-11-23 22:51:56,472 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-23 22:51:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-11-23 22:51:56,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-23 22:51:56,473 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:51:56,473 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-23 22:51:56,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 22:51:56,473 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-23 22:51:56,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:51:56,474 INFO L85 PathProgramCache]: Analyzing trace with hash 972300203, now seen corresponding path program 1 times [2024-11-23 22:51:56,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:51:56,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824884381] [2024-11-23 22:51:56,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:56,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:51:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:57,472 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-23 22:51:57,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:51:57,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824884381] [2024-11-23 22:51:57,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824884381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:51:57,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332694855] [2024-11-23 22:51:57,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:51:57,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:51:57,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:51:57,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:51:57,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 22:51:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:51:57,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-23 22:51:57,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:51:57,867 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 22:51:57,868 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-23 22:51:58,036 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-23 22:51:58,037 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-23 22:51:58,266 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-23 22:51:58,267 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-23 22:51:58,334 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-23 22:51:58,384 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-23 22:51:58,476 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-23 22:51:58,514 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-23 22:51:58,618 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-23 22:51:58,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:51:58,693 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-23 22:51:58,701 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-23 22:51:58,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:51:58,711 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-23 22:51:58,716 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-23 22:51:58,723 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-23 22:51:58,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 20 treesize of output 16 [2024-11-23 22:51:59,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:51:59,669 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-23 22:51:59,830 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-23 22:51:59,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332694855] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:51:59,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:51:59,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 41 [2024-11-23 22:51:59,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984118881] [2024-11-23 22:51:59,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:51:59,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-23 22:51:59,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:51:59,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-23 22:51:59,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1329, Unknown=6, NotChecked=150, Total=1640 [2024-11-23 22:51:59,837 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-23 22:52:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:52:00,720 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-23 22:52:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 22:52:00,721 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-23 22:52:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:52:00,721 INFO L225 Difference]: With dead ends: 83 [2024-11-23 22:52:00,722 INFO L226 Difference]: Without dead ends: 83 [2024-11-23 22:52:00,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=365, Invalid=2087, Unknown=6, NotChecked=194, Total=2652 [2024-11-23 22:52:00,723 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-11-23 22:52:00,724 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.4s Time] [2024-11-23 22:52:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-23 22:52:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-23 22:52:00,726 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-23 22:52:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2024-11-23 22:52:00,727 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 45 [2024-11-23 22:52:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:52:00,727 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-11-23 22:52:00,727 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-23 22:52:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2024-11-23 22:52:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-23 22:52:00,728 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:52:00,728 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-23 22:52:00,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-23 22:52:00,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-23 22:52:00,932 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-23 22:52:00,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:52:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1919567614, now seen corresponding path program 1 times [2024-11-23 22:52:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:52:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505160187] [2024-11-23 22:52:00,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:52:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:52:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:52:02,281 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-23 22:52:02,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:52:02,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505160187] [2024-11-23 22:52:02,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505160187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:52:02,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148307604] [2024-11-23 22:52:02,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:52:02,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:52:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:52:02,284 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:52:02,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 22:52:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:52:02,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-23 22:52:02,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:52:02,579 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 22:52:02,580 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-23 22:52:02,669 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-23 22:52:02,669 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-23 22:52:02,810 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-23 22:52:02,810 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-23 22:52:02,845 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-23 22:52:02,889 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-23 22:52:02,912 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 22:52:02,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-23 22:52:03,000 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-23 22:52:03,021 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-23 22:52:03,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:52:03,181 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-23 22:52:03,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:52:03,198 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-23 22:52:03,205 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-23 22:52:03,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:52:03,387 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-23 22:52:03,399 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2024-11-23 22:52:03,399 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-23 22:52:03,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:52:03,569 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-23 22:52:03,573 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-23 22:52:03,578 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-23 22:52:03,580 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-23 22:52:04,038 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-23 22:52:04,038 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-23 22:52:04,057 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-23 22:52:04,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148307604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:52:04,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:52:04,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 44 [2024-11-23 22:52:04,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686573049] [2024-11-23 22:52:04,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:52:04,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-23 22:52:04,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:52:04,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-23 22:52:04,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1684, Unknown=31, NotChecked=84, Total=1980 [2024-11-23 22:52:04,060 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-23 22:52:05,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:52:05,118 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-11-23 22:52:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 22:52:05,119 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-23 22:52:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:52:05,120 INFO L225 Difference]: With dead ends: 87 [2024-11-23 22:52:05,121 INFO L226 Difference]: Without dead ends: 87 [2024-11-23 22:52:05,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=377, Invalid=2565, Unknown=32, NotChecked=106, Total=3080 [2024-11-23 22:52:05,123 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 77 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-23 22:52:05,123 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.6s Time] [2024-11-23 22:52:05,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-23 22:52:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-23 22:52:05,128 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-23 22:52:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-11-23 22:52:05,132 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 47 [2024-11-23 22:52:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:52:05,133 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-11-23 22:52:05,133 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-23 22:52:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-11-23 22:52:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-23 22:52:05,134 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:52:05,134 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-23 22:52:05,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-23 22:52:05,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-23 22:52:05,334 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-23 22:52:05,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:52:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1919567613, now seen corresponding path program 1 times [2024-11-23 22:52:05,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:52:05,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201159689] [2024-11-23 22:52:05,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:52:05,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:52:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:52:07,075 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-23 22:52:07,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:52:07,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201159689] [2024-11-23 22:52:07,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201159689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:52:07,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197825196] [2024-11-23 22:52:07,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:52:07,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:52:07,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:52:07,078 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:52:07,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 22:52:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:52:07,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-23 22:52:07,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:52:07,413 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-23 22:52:07,413 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-23 22:52:07,487 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-23 22:52:07,501 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-23 22:52:07,502 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-23 22:52:07,666 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 22:52:07,666 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-23 22:52:07,688 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-23 22:52:07,688 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-23 22:52:07,753 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-23 22:52:07,763 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-23 22:52:07,827 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-23 22:52:07,838 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-23 22:52:07,868 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 22:52:07,868 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-23 22:52:07,878 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-23 22:52:08,012 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-23 22:52:08,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-23 22:52:08,091 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-23 22:52:08,110 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-23 22:52:08,329 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-23 22:52:08,342 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-23 22:52:08,362 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-23 22:52:08,368 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-23 22:52:08,430 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-23 22:52:08,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:52:08,677 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-23 22:52:08,702 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-23 22:52:08,720 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-23 22:52:08,775 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-23 22:52:08,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:52:08,805 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-23 22:52:08,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:52:08,825 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-23 22:52:08,849 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-23 22:52:08,876 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-23 22:52:08,885 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-23 22:52:08,909 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-23 22:52:09,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:52:09,140 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-23 22:52:09,169 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-23 22:52:11,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:52:11,561 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-23 22:52:11,830 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-23 22:52:11,830 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-23 22:52:11,867 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-23 22:52:11,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197825196] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:52:11,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:52:11,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 44 [2024-11-23 22:52:11,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699268598] [2024-11-23 22:52:11,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:52:11,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-23 22:52:11,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:52:11,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-23 22:52:11,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1499, Unknown=4, NotChecked=324, Total=1980 [2024-11-23 22:52:11,870 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-23 22:52:14,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:52:14,096 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-23 22:52:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-23 22:52:14,097 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-23 22:52:14,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:52:14,097 INFO L225 Difference]: With dead ends: 93 [2024-11-23 22:52:14,097 INFO L226 Difference]: Without dead ends: 93 [2024-11-23 22:52:14,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=342, Invalid=2640, Unknown=4, NotChecked=436, Total=3422 [2024-11-23 22:52:14,099 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:52:14,099 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.0s Time] [2024-11-23 22:52:14,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-23 22:52:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-23 22:52:14,102 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-23 22:52:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-23 22:52:14,103 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 47 [2024-11-23 22:52:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:52:14,103 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-23 22:52:14,104 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-23 22:52:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-23 22:52:14,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-23 22:52:14,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:52:14,105 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-23 22:52:14,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-23 22:52:14,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-23 22:52:14,309 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-23 22:52:14,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:52:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2131544921, now seen corresponding path program 1 times [2024-11-23 22:52:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:52:14,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045555284] [2024-11-23 22:52:14,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:52:14,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:52:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:52:14,475 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-23 22:52:14,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:52:14,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045555284] [2024-11-23 22:52:14,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045555284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:52:14,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:52:14,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 22:52:14,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745783099] [2024-11-23 22:52:14,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:52:14,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 22:52:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:52:14,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 22:52:14,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 22:52:14,477 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-23 22:52:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:52:14,597 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-23 22:52:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 22:52:14,597 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-23 22:52:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:52:14,598 INFO L225 Difference]: With dead ends: 92 [2024-11-23 22:52:14,598 INFO L226 Difference]: Without dead ends: 92 [2024-11-23 22:52:14,598 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-23 22:52:14,599 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-23 22:52:14,600 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-23 22:52:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-23 22:52:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-11-23 22:52:14,602 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-23 22:52:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-23 22:52:14,605 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 49 [2024-11-23 22:52:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:52:14,605 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-23 22:52:14,605 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-23 22:52:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-23 22:52:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-23 22:52:14,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:52:14,606 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-23 22:52:14,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-23 22:52:14,606 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-23 22:52:14,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:52:14,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2131544922, now seen corresponding path program 1 times [2024-11-23 22:52:14,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:52:14,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547166025] [2024-11-23 22:52:14,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:52:14,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:52:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:52:14,838 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-23 22:52:14,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:52:14,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547166025] [2024-11-23 22:52:14,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547166025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:52:14,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:52:14,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 22:52:14,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551653199] [2024-11-23 22:52:14,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:52:14,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:52:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:52:14,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:52:14,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:52:14,840 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-23 22:52:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:52:14,973 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-23 22:52:14,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 22:52:14,973 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-23 22:52:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:52:14,974 INFO L225 Difference]: With dead ends: 91 [2024-11-23 22:52:14,974 INFO L226 Difference]: Without dead ends: 91 [2024-11-23 22:52:14,975 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-23 22:52:14,975 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.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:52:14,975 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.1s Time] [2024-11-23 22:52:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-23 22:52:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-23 22:52:14,978 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-23 22:52:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-23 22:52:14,980 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 49 [2024-11-23 22:52:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:52:14,980 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-23 22:52:14,980 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-23 22:52:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-23 22:52:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-23 22:52:14,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:52:14,981 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-23 22:52:14,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-23 22:52:14,981 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-23 22:52:14,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:52:14,982 INFO L85 PathProgramCache]: Analyzing trace with hash -364770338, now seen corresponding path program 1 times [2024-11-23 22:52:14,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:52:14,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278883857] [2024-11-23 22:52:14,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:52:14,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:52:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:52:17,441 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-23 22:52:17,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:52:17,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278883857] [2024-11-23 22:52:17,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278883857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:52:17,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006680584] [2024-11-23 22:52:17,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:52:17,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:52:17,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:52:17,446 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:52:17,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 22:52:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:52:17,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-23 22:52:17,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:52:17,842 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-23 22:52:17,842 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-23 22:52:18,018 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-23 22:52:18,018 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-23 22:52:18,148 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-23 22:52:18,219 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-23 22:52:18,467 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-23 22:52:18,468 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-23 22:52:18,555 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-23 22:52:18,562 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-23 22:52:18,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 22:52:18,666 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-23 22:52:18,677 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-23 22:52:18,684 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-23 22:52:18,722 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 22:52:18,722 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-23 22:52:18,732 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-23 22:52:18,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-23 22:52:18,901 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-23 22:52:18,908 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-23 22:52:18,917 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-23 22:52:18,940 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-23 22:52:18,946 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-23 22:52:18,953 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-23 22:52:19,228 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-23 22:52:19,237 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-23 22:52:19,248 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-23 22:52:19,272 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-23 22:52:19,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:52:19,282 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-23 22:52:19,531 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-23 22:52:19,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:52:20,169 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-23 22:52:21,065 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-23 22:52:21,221 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-23 22:52:21,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:52:21,287 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-23 22:52:21,299 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-23 22:52:21,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 294 [2024-11-23 22:52:21,320 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-23 22:52:21,330 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-23 22:52:21,343 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-23 22:52:21,360 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-23 22:52:21,377 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-23 22:52:21,389 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-23 22:52:21,401 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-23 22:52:21,415 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-23 22:52:21,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:52:21,449 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-23 22:52:21,475 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-23 22:52:21,500 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-23 22:52:21,954 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-23 22:52:22,061 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-23 22:52:22,078 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-23 22:52:23,670 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-23 22:52:23,690 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-23 22:52:23,716 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-23 22:52:23,746 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-23 22:52:23,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-23 22:52:23,797 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-23 22:52:23,855 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-23 22:52:25,071 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-23 22:52:25,091 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-23 22:52:25,116 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-23 22:52:25,146 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-23 22:52:25,163 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-23 22:52:25,194 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-23 22:52:25,250 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-23 22:52:25,307 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-23 22:52:25,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 13 treesize of output 1 [2024-11-23 22:52:25,450 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-23 22:52:25,477 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-23 22:52:26,162 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-23 22:52:26,218 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-23 22:52:26,311 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-23 22:52:26,536 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-23 22:52:26,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-23 22:52:27,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-23 22:52:27,503 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-23 22:52:27,548 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-23 22:52:27,582 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-23 22:52:27,631 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-23 22:52:27,658 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-23 22:52:27,759 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-23 22:52:27,778 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-23 22:52:27,807 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-23 22:52:27,850 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-23 22:52:27,883 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-23 22:52:28,014 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-23 22:52:28,039 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-23 22:52:29,197 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-23 22:52:29,223 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-23 22:52:29,268 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-23 22:52:29,297 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-23 22:52:29,361 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-23 22:52:31,769 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-23 22:52:31,938 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-23 22:52:31,946 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-23 22:52:32,041 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-23 22:52:32,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 8 treesize of output 6 [2024-11-23 22:52:32,319 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-23 22:52:32,884 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-23 22:52:32,891 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-23 22:52:33,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 8 treesize of output 6 [2024-11-23 22:52:33,107 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-23 22:52:33,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 8 treesize of output 6 [2024-11-23 22:52:33,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 8 treesize of output 6 [2024-11-23 22:52:33,283 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-23 22:53:54,187 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:54,304 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 22:53:54,305 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-23 22:53:54,350 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-23 22:53:54,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:54,406 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-23 22:53:54,423 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:54,429 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-23 22:53:54,446 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-23 22:53:54,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 6 treesize of output 4 [2024-11-23 22:53:54,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:54,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:54,703 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-23 22:53:55,260 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 22:53:55,260 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-23 22:53:55,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:55,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 432 treesize of output 428 [2024-11-23 22:53:55,311 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:55,316 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-23 22:53:55,325 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:55,330 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-23 22:53:55,342 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-23 22:53:55,574 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-23 22:53:55,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:55,680 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-23 22:53:55,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:55,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:55,748 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-23 22:53:55,773 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-23 22:53:55,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:55,788 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-23 22:53:55,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:55,815 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-23 22:53:55,827 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-23 22:53:55,845 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-23 22:53:55,873 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:55,874 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-23 22:53:55,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:55,908 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-23 22:53:55,990 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:56,093 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 22:53:56,093 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-23 22:53:56,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:56,149 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-23 22:53:56,161 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:56,167 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-23 22:53:56,183 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-23 22:53:56,198 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-23 22:53:56,357 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-23 22:53:56,444 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:56,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:56,472 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-23 22:53:56,716 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:56,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:56,734 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-23 22:53:56,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:56,787 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-23 22:53:56,804 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-23 22:53:56,823 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-23 22:53:56,838 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-23 22:53:57,035 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-23 22:53:57,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:57,050 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-23 22:53:57,081 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:57,305 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-23 22:53:57,305 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-23 22:53:57,351 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-23 22:53:57,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:57,505 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-23 22:53:57,525 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:57,531 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-23 22:53:57,557 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-23 22:53:57,998 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-23 22:53:58,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-23 22:53:58,146 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-23 22:53:58,235 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-23 22:53:58,310 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-23 22:53:59,694 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:53:59,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:53:59,724 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-23 22:54:00,917 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-23 22:54:00,925 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-23 22:54:00,935 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-23 22:54:00,945 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-23 22:54:01,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:01,158 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 22:54:01,159 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-23 22:54:01,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:01,218 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-23 22:54:01,237 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:01,244 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-23 22:54:01,267 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-23 22:54:01,291 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-23 22:54:01,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-23 22:54:01,706 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:01,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:01,736 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-23 22:54:02,292 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:02,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:02,305 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-23 22:54:02,328 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-23 22:54:02,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:02,345 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-23 22:54:02,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:02,373 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-23 22:54:02,385 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-23 22:54:02,409 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-23 22:54:02,439 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:02,440 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-23 22:54:02,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:02,475 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-23 22:54:02,598 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:02,602 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-23 22:54:02,611 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-23 22:54:02,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-11-23 22:54:02,667 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-23 22:54:02,679 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:02,909 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-23 22:54:02,910 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-23 22:54:02,947 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-23 22:54:02,991 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:03,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:03,072 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-23 22:54:03,092 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:03,098 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-23 22:54:03,121 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-23 22:54:03,519 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-23 22:54:03,913 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-23 22:54:03,960 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-23 22:54:05,481 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:05,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:05,509 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-23 22:54:06,068 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:06,079 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:06,299 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-23 22:54:06,299 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-23 22:54:06,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:06,426 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-23 22:54:06,444 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:06,450 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-23 22:54:06,472 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-23 22:54:06,495 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-23 22:54:06,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-23 22:54:07,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-23 22:54:07,863 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:07,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:07,891 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-23 22:54:08,908 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:09,013 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 22:54:09,014 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-23 22:54:09,033 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-23 22:54:09,048 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-23 22:54:09,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:09,093 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-23 22:54:09,111 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:09,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:09,131 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-23 22:54: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 6 treesize of output 4 [2024-11-23 22:54:09,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:09,428 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-23 22:54:09,448 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-23 22:54:09,500 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:09,500 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-23 22:54:09,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:09,648 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-23 22:54:10,011 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:10,018 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:10,238 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-23 22:54:10,238 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-23 22:54:10,270 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-23 22:54:10,306 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:10,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:10,383 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-23 22:54:10,401 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:10,409 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-23 22:54:10,434 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-23 22:54:10,524 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-23 22:54:11,007 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-23 22:54:11,016 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-23 22:54:11,080 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-23 22:54:11,096 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-23 22:54:12,124 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:12,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:12,152 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-23 22:54:13,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:13,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:13,848 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 22:54:13,848 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-23 22:54:13,873 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:13,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:13,902 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-23 22:54:13,912 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:13,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 124 treesize of output 116 [2024-11-23 22:54:13,932 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-23 22:54:14,111 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-23 22:54:14,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:14,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:14,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2024-11-23 22:54:14,510 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:14,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:14,522 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-23 22:54:14,542 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-23 22:54:14,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:14,558 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-23 22:54:14,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:14,586 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-23 22:54:14,598 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-23 22:54:14,624 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-23 22:54:14,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:14,642 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-23 22:54:14,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:14,692 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-23 22:54:14,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:14,790 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:14,900 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 22:54:14,900 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-23 22:54:14,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:14,953 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-23 22:54:14,963 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:14,968 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-23 22:54:14,983 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-23 22:54:14,999 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-23 22:54:15,164 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:15,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:15,191 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-23 22:54:15,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:15,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:15,496 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-23 22:54:15,516 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-23 22:54:15,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:15,533 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-23 22:54:15,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:15,560 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-23 22:54:15,570 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-23 22:54:15,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-23 22:54:15,606 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:15,606 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-23 22:54:15,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:15,660 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-23 22:54:15,747 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:15,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:15,869 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 22:54:15,870 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-23 22:54:15,894 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:15,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:15,923 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-23 22:54:15,933 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:15,938 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-23 22:54:15,952 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-23 22:54:15,992 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-23 22:54:16,112 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:16,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:16,139 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-23 22:54:16,469 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:16,575 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 22:54:16,575 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-23 22:54:16,616 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:16,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:16,656 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-23 22:54:16,671 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:16,677 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-23 22:54:16,694 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-23 22:54:16,711 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-23 22:54:16,730 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-23 22:54:16,953 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:16,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:16,980 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-23 22:54:17,537 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:17,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:17,552 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-23 22:54:17,573 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-23 22:54:17,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:17,601 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-23 22:54:17,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:17,618 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-23 22:54:17,629 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-23 22:54:17,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 12 treesize of output 8 [2024-11-23 22:54:17,690 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:17,691 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-23 22:54:17,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:17,727 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-23 22:54:17,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:17,916 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 22:54:17,916 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-23 22:54:17,938 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-23 22:54:17,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:17,985 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-23 22:54:17,997 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:18,002 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-23 22:54:18,019 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-23 22:54:18,278 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-23 22:54:18,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:18,677 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-23 22:54:18,765 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:18,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:18,882 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 22:54:18,882 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-23 22:54:18,895 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-23 22:54:18,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:18,941 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-23 22:54:18,951 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:18,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 170 treesize of output 162 [2024-11-23 22:54:18,973 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-23 22:54:19,140 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:19,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:19,167 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-23 22:54:19,323 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:19,333 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:19,340 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:19,567 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-23 22:54:19,567 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-23 22:54:19,605 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:19,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:19,689 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-23 22:54:19,705 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:19,711 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-23 22:54:19,731 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-23 22:54:19,801 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-23 22:54:20,963 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-23 22:54:21,042 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-23 22:54:21,211 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-23 22:54:21,245 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:54:21,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:54:21,273 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-23 22:55:36,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:55:36,498 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-23 22:55:46,840 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-23 22:55:46,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006680584] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:55:46,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:55:46,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 24] total 68 [2024-11-23 22:55:46,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011263945] [2024-11-23 22:55:46,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:55:46,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-23 22:55:46,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:55:46,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-23 22:55:46,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=3777, Unknown=140, NotChecked=384, Total=4556 [2024-11-23 22:55:46,843 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-23 22:56:33,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-23 22:57:13,322 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-23 22:57:17,483 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-23 22:57:21,648 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-23 22:57:25,738 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-23 22:57:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:57:55,718 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2024-11-23 22:57:55,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-23 22:57:55,765 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-23 22:57:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:57:55,765 INFO L225 Difference]: With dead ends: 86 [2024-11-23 22:57:55,765 INFO L226 Difference]: Without dead ends: 86 [2024-11-23 22:57:55,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1628 ImplicationChecksByTransitivity, 193.5s TimeCoverageRelationStatistics Valid=665, Invalid=6497, Unknown=160, NotChecked=510, Total=7832 [2024-11-23 22:57:55,767 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 56 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.2s 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, 68.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:57:55,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 900 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1400 Invalid, 4 Unknown, 148 Unchecked, 68.1s Time] [2024-11-23 22:57:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-23 22:57:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-23 22:57:55,769 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-23 22:57:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2024-11-23 22:57:55,770 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 51 [2024-11-23 22:57:55,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:57:55,770 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2024-11-23 22:57:55,770 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-23 22:57:55,770 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2024-11-23 22:57:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-23 22:57:55,771 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:57:55,771 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-23 22:57:55,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-23 22:57:55,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-23 22:57:55,972 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-23 22:57:55,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:57:55,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1645831285, now seen corresponding path program 2 times [2024-11-23 22:57:55,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:57:55,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416042233] [2024-11-23 22:57:55,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 22:57:55,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:57:56,074 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 22:57:56,074 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 22:58:07,761 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-23 22:58:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:58:07,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416042233] [2024-11-23 22:58:07,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416042233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:58:07,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449023103] [2024-11-23 22:58:07,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 22:58:07,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:58:07,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:58:07,764 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:58:07,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 22:58:08,017 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 22:58:08,017 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 22:58:08,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-23 22:58:08,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:58:08,769 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-23 22:58:08,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-23 22:58:11,039 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-23 22:58:11,039 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-23 22:58:12,200 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-23 22:58:12,401 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-23 22:58:13,223 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-23 22:58:13,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-23 22:58:13,596 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 22:58:13,596 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-23 22:58:13,664 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-23 22:58:16,081 INFO L349 Elim1Store]: treesize reduction 72, result has 33.3 percent of original size [2024-11-23 22:58:16,081 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-23 22:58:17,452 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-23 22:58:17,632 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-23 22:58:18,755 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-23 22:58:18,755 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-23 22:58:18,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:18,956 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-23 22:58:19,062 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-23 22:58:19,062 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-23 22:58:19,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:19,267 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-23 22:58:22,041 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-23 22:58:22,041 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-23 22:58:22,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:22,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:22,338 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-23 22:58:23,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:23,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:23,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:23,475 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-23 22:58:23,767 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-11-23 22:58:23,768 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-23 22:58:27,880 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-23 22:58:27,881 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-23 22:58:27,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:27,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:27,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:27,959 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-23 22:58:33,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:33,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:33,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:58:33,414 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-23 22:58:33,415 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-23 22:58:34,265 INFO L349 Elim1Store]: treesize reduction 160, result has 23.1 percent of original size [2024-11-23 22:58:34,265 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-23 22:58:35,456 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:58:35,833 INFO L349 Elim1Store]: treesize reduction 36, result has 30.8 percent of original size [2024-11-23 22:58:35,833 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-23 22:58:35,999 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2024-11-23 22:58:35,999 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-23 22:58:38,844 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-23 22:58:38,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:58:47,266 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-23 22:58:49,170 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-23 22:58:49,759 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-23 22:58:50,349 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-23 22:58:51,212 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-23 22:58:55,468 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-23 22:58:56,284 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-23 22:58:58,296 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-23 22:58:59,907 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-23 23:00:00,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:00:00,328 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:00:00,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:00:00,881 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-23 23:00:01,152 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:00:01,547 INFO L224 Elim1Store]: Index analysis took 484 ms [2024-11-23 23:00:03,983 INFO L349 Elim1Store]: treesize reduction 158, result has 29.5 percent of original size [2024-11-23 23:00:03,983 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-23 23:00:04,154 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:00:08,774 INFO L349 Elim1Store]: treesize reduction 288, result has 32.6 percent of original size [2024-11-23 23:00:08,777 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-23 23:00:13,328 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:00:13,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:00:13,931 INFO L224 Elim1Store]: Index analysis took 505 ms [2024-11-23 23:00:19,203 WARN L286 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 212 DAG size of output: 106 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-23 23:00:19,203 INFO L349 Elim1Store]: treesize reduction 352, result has 40.8 percent of original size [2024-11-23 23:00:19,204 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-23 23:00:25,879 WARN L286 SmtUtils]: Spent 6.67s 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-23 23:00:26,674 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:00:26,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:00:26,776 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:00:26,815 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:00:26,817 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-23 23:01:56,352 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-23 23:01:59,375 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:01:59,381 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:01:59,389 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:01:59,395 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:01:59,396 INFO L224 Elim1Store]: Index analysis took 139 ms [2024-11-23 23:01:59,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:01:59,924 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-23 23:02:03,256 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:03,287 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:03,293 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:03,299 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:03,299 INFO L224 Elim1Store]: Index analysis took 141 ms [2024-11-23 23:02:03,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:02:03,784 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-23 23:02:05,275 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-23 23:02:05,520 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:05,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:05,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:02:05,830 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-23 23:02:06,575 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:06,580 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:06,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:02:06,866 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-23 23:02:07,521 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:07,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:07,627 INFO L224 Elim1Store]: Index analysis took 147 ms [2024-11-23 23:02:08,801 INFO L349 Elim1Store]: treesize reduction 111, result has 33.1 percent of original size [2024-11-23 23:02:08,802 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-23 23:02:21,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:21,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:21,715 INFO L224 Elim1Store]: Index analysis took 155 ms [2024-11-23 23:02:22,481 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-11-23 23:02:22,482 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-23 23:02:29,566 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:29,707 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:02:29,990 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-11-23 23:02:29,990 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-23 23:04:42,467 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-23 23:04:42,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-23 23:04:42,468 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-23 23:04:42,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-23 23:04:42,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:42,670 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_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/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.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) 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) ... 69 more [2024-11-23 23:04:42,677 INFO L158 Benchmark]: Toolchain (without parser) took 772964.27ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 104.6MB in the beginning and 1.1GB in the end (delta: -986.5MB). Peak memory consumption was 868.0MB. Max. memory is 16.1GB. [2024-11-23 23:04:42,677 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 167.8MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:04:42,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.46ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 86.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 23:04:42,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.62ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 85.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:04:42,677 INFO L158 Benchmark]: Boogie Preprocessor took 69.08ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 83.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:04:42,678 INFO L158 Benchmark]: RCFGBuilder took 619.74ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 62.8MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-23 23:04:42,678 INFO L158 Benchmark]: TraceAbstraction took 771680.34ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 62.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 826.0MB. Max. memory is 16.1GB. [2024-11-23 23:04:42,679 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 167.8MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.46ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 86.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.62ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 85.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.08ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 83.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 619.74ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 62.8MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 771680.34ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 62.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 826.0MB. 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_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/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_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/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_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/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_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC --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-6497de0 [2024-11-23 23:04:45,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:04:45,521 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-23 23:04:45,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:04:45,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:04:45,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:04:45,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:04:45,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:04:45,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:04:45,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:04:45,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:04:45,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:04:45,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:04:45,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:04:45,561 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:04:45,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:04:45,561 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:04:45,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:04:45,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:04:45,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:04:45,566 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-23 23:04:45,566 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-23 23:04:45,566 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-23 23:04:45,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:04:45,566 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 23:04:45,566 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-23 23:04:45,566 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-23 23:04:45,566 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 23:04:45,566 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:04:45,567 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:04:45,567 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:04:45,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:04:45,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:04:45,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:04:45,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:04:45,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:04:45,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:04:45,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:04:45,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:04:45,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:04:45,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:04:45,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:04:45,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:04:45,568 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-23 23:04:45,568 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-23 23:04:45,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:04:45,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:04:45,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:04:45,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:04:45,569 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_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC 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-23 23:04:45,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:04:45,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:04:45,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:04:45,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:04:45,997 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:04:45,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-23 23:04:48,938 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/data/3aa0c382c/29c60a00358f4ad09605cb1a386ac3a1/FLAGc953bf893 [2024-11-23 23:04:49,278 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:04:49,279 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-23 23:04:49,296 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/data/3aa0c382c/29c60a00358f4ad09605cb1a386ac3a1/FLAGc953bf893 [2024-11-23 23:04:49,318 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/data/3aa0c382c/29c60a00358f4ad09605cb1a386ac3a1 [2024-11-23 23:04:49,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:04:49,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:04:49,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:04:49,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:04:49,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:04:49,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725848e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49, skipping insertion in model container [2024-11-23 23:04:49,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:04:49,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:04:49,747 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:04:49,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:04:49,843 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:04:49,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49 WrapperNode [2024-11-23 23:04:49,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:04:49,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:04:49,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:04:49,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:04:49,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,888 INFO L138 Inliner]: procedures = 125, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-11-23 23:04:49,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:04:49,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:04:49,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:04:49,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:04:49,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,922 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-23 23:04:49,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:04:49,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:04:49,951 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:04:49,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:04:49,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (1/1) ... [2024-11-23 23:04:49,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:04:49,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:04:49,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:04:49,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:04:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-23 23:04:50,017 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-23 23:04:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-23 23:04:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-23 23:04:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 23:04:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:04:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 23:04:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 23:04:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 23:04:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 23:04:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 23:04:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-23 23:04:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-23 23:04:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-23 23:04:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-23 23:04:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:04:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:04:50,155 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:04:50,157 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:04:50,180 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-23 23:04:50,625 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-23 23:04:50,626 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:04:50,639 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:04:50,640 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-23 23:04:50,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:04:50 BoogieIcfgContainer [2024-11-23 23:04:50,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:04:50,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:04:50,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:04:50,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:04:50,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:04:49" (1/3) ... [2024-11-23 23:04:50,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536ecef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:04:50, skipping insertion in model container [2024-11-23 23:04:50,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:49" (2/3) ... [2024-11-23 23:04:50,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536ecef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:04:50, skipping insertion in model container [2024-11-23 23:04:50,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:04:50" (3/3) ... [2024-11-23 23:04:50,651 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2024-11-23 23:04:50,662 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:04:50,663 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-23 23:04:50,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:04:50,707 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;@4455e747, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:04:50,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-23 23:04:50,713 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-23 23:04:50,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-23 23:04:50,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:04:50,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-23 23:04:50,721 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-23 23:04:50,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:04:50,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-23 23:04:50,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:04:50,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2125135198] [2024-11-23 23:04:50,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:04:50,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:50,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:04:50,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:04:50,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:04:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:04:50,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 23:04:50,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:04:50,885 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-23 23:04:50,919 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-23 23:04:50,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:04:50,920 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:04:50,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125135198] [2024-11-23 23:04:50,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125135198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:04:50,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:04:50,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:04:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789306018] [2024-11-23 23:04:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:04:50,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:04:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:04:50,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:04:50,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:04:50,955 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-23 23:04:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:04:51,173 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2024-11-23 23:04:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:04:51,175 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-23 23:04:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:04:51,181 INFO L225 Difference]: With dead ends: 79 [2024-11-23 23:04:51,182 INFO L226 Difference]: Without dead ends: 73 [2024-11-23 23:04:51,183 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-23 23:04:51,188 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-23 23:04:51,188 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-23 23:04:51,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-23 23:04:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-23 23:04:51,242 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-23 23:04:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-11-23 23:04:51,248 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 4 [2024-11-23 23:04:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:04:51,248 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-11-23 23:04:51,249 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-23 23:04:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-11-23 23:04:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-23 23:04:51,249 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:04:51,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-23 23:04:51,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 23:04:51,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:51,451 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-23 23:04:51,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:04:51,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-23 23:04:51,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:04:51,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1892483594] [2024-11-23 23:04:51,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:04:51,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:51,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:04:51,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:04:51,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:04:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:04:51,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 23:04:51,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:04:51,606 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-23 23:04:51,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-23 23:04:51,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:04:51,633 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:04:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892483594] [2024-11-23 23:04:51,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892483594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:04:51,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:04:51,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:04:51,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011462481] [2024-11-23 23:04:51,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:04:51,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:04:51,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:04:51,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:04:51,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:04:51,636 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-23 23:04:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:04:51,828 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-23 23:04:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:04:51,833 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-23 23:04:51,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:04:51,833 INFO L225 Difference]: With dead ends: 69 [2024-11-23 23:04:51,834 INFO L226 Difference]: Without dead ends: 69 [2024-11-23 23:04:51,834 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-23 23:04:51,834 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-23 23:04:51,835 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-23 23:04:51,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-23 23:04:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-23 23:04:51,839 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-23 23:04:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-23 23:04:51,843 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 4 [2024-11-23 23:04:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:04:51,844 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-23 23:04:51,844 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-23 23:04:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-23 23:04:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-23 23:04:51,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:04:51,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:04:51,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-23 23:04:52,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:52,046 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-23 23:04:52,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:04:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash -401980876, now seen corresponding path program 1 times [2024-11-23 23:04:52,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:04:52,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544074452] [2024-11-23 23:04:52,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:04:52,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:52,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:04:52,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:04:52,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:04:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:04:52,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 23:04:52,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:04:52,184 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-23 23:04:52,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:04:52,185 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:04:52,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544074452] [2024-11-23 23:04:52,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544074452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:04:52,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:04:52,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:04:52,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306846701] [2024-11-23 23:04:52,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:04:52,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:04:52,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:04:52,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:04:52,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:04:52,188 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-23 23:04:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:04:52,459 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2024-11-23 23:04:52,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:04:52,460 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-23 23:04:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:04:52,461 INFO L225 Difference]: With dead ends: 81 [2024-11-23 23:04:52,461 INFO L226 Difference]: Without dead ends: 81 [2024-11-23 23:04:52,461 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-23 23:04:52,462 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.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:04:52,462 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.2s Time] [2024-11-23 23:04:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-23 23:04:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-11-23 23:04:52,469 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-23 23:04:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-11-23 23:04:52,474 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 10 [2024-11-23 23:04:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:04:52,475 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-11-23 23:04:52,475 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-23 23:04:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-11-23 23:04:52,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-23 23:04:52,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:04:52,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:04:52,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-23 23:04:52,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:52,676 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-23 23:04:52,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:04:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash -401980875, now seen corresponding path program 1 times [2024-11-23 23:04:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:04:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089224932] [2024-11-23 23:04:52,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:04:52,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:52,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:04:52,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:04:52,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:04:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:04:52,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 23:04:52,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:04:52,812 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-23 23:04:52,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:04:52,812 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:04:52,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089224932] [2024-11-23 23:04:52,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089224932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:04:52,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:04:52,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:04:52,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441290260] [2024-11-23 23:04:52,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:04:52,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:04:52,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:04:52,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:04:52,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:04:52,817 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-23 23:04:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:04:52,843 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-11-23 23:04:52,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:04:52,843 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-23 23:04:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:04:52,844 INFO L225 Difference]: With dead ends: 81 [2024-11-23 23:04:52,844 INFO L226 Difference]: Without dead ends: 81 [2024-11-23 23:04:52,844 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-23 23:04:52,845 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-23 23:04:52,845 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-23 23:04:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-23 23:04:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2024-11-23 23:04:52,849 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-23 23:04:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2024-11-23 23:04:52,850 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 10 [2024-11-23 23:04:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:04:52,851 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2024-11-23 23:04:52,851 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-23 23:04:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-23 23:04:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 23:04:52,851 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:04:52,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:04:52,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-23 23:04:53,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:53,052 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-23 23:04:53,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:04:53,054 INFO L85 PathProgramCache]: Analyzing trace with hash 423414423, now seen corresponding path program 1 times [2024-11-23 23:04:53,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:04:53,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [748726040] [2024-11-23 23:04:53,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:04:53,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:53,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:04:53,058 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:04:53,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 23:04:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:04:53,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 23:04:53,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:04:53,162 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-23 23:04:53,175 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-23 23:04:53,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:04:53,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:04:53,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748726040] [2024-11-23 23:04:53,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748726040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:04:53,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:04:53,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:04:53,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466051142] [2024-11-23 23:04:53,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:04:53,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:04:53,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:04:53,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:04:53,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:04:53,181 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-23 23:04:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:04:53,342 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-11-23 23:04:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:04:53,346 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-23 23:04:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:04:53,347 INFO L225 Difference]: With dead ends: 73 [2024-11-23 23:04:53,349 INFO L226 Difference]: Without dead ends: 73 [2024-11-23 23:04:53,350 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-23 23:04:53,350 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-23 23:04:53,351 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-23 23:04:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-23 23:04:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-23 23:04:53,356 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-23 23:04:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-11-23 23:04:53,357 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 11 [2024-11-23 23:04:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:04:53,358 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-11-23 23:04:53,358 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-23 23:04:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-11-23 23:04:53,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 23:04:53,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:04:53,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:04:53,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-23 23:04:53,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:53,563 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-23 23:04:53,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:04:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash 423414424, now seen corresponding path program 1 times [2024-11-23 23:04:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:04:53,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756731482] [2024-11-23 23:04:53,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:04:53,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:53,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:04:53,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:04:53,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 23:04:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:04:53,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 23:04:53,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:04:53,664 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-23 23:04:53,684 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-23 23:04:53,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:04:53,685 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:04:53,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756731482] [2024-11-23 23:04:53,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756731482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:04:53,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:04:53,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:04:53,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871891068] [2024-11-23 23:04:53,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:04:53,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:04:53,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:04:53,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:04:53,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:04:53,687 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-23 23:04:53,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:04:53,840 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-23 23:04:53,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:04:53,843 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-23 23:04:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:04:53,843 INFO L225 Difference]: With dead ends: 71 [2024-11-23 23:04:53,843 INFO L226 Difference]: Without dead ends: 71 [2024-11-23 23:04:53,843 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-23 23:04:53,844 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-23 23:04:53,844 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-23 23:04:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-23 23:04:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-23 23:04:53,854 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-23 23:04:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-23 23:04:53,855 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 11 [2024-11-23 23:04:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:04:53,855 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-23 23:04:53,855 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-23 23:04:53,855 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-23 23:04:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-23 23:04:53,856 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:04:53,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:04:53,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-23 23:04:54,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:54,063 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-23 23:04:54,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:04:54,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1120632133, now seen corresponding path program 1 times [2024-11-23 23:04:54,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:04:54,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844349928] [2024-11-23 23:04:54,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:04:54,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:54,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:04:54,066 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:04:54,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 23:04:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:04:54,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-23 23:04:54,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:04:54,172 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-23 23:04:54,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:04:54,343 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-23 23:04:54,361 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-23 23:04:54,361 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-23 23:04:54,407 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-23 23:04:54,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:04:54,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:04:54,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844349928] [2024-11-23 23:04:54,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844349928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:04:54,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:04:54,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:04:54,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488879957] [2024-11-23 23:04:54,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:04:54,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:04:54,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:04:54,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:04:54,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:04:54,409 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-23 23:04:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:04:54,808 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-23 23:04:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:04:54,809 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-23 23:04:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:04:54,810 INFO L225 Difference]: With dead ends: 71 [2024-11-23 23:04:54,810 INFO L226 Difference]: Without dead ends: 71 [2024-11-23 23:04:54,810 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-23 23:04:54,811 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-23 23:04:54,811 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-23 23:04:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-23 23:04:54,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-23 23:04:54,817 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-23 23:04:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-23 23:04:54,818 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 13 [2024-11-23 23:04:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:04:54,818 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-23 23:04:54,818 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-23 23:04:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-23 23:04:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-23 23:04:54,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:04:54,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:04:54,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-23 23:04:55,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:55,020 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-23 23:04:55,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:04:55,020 INFO L85 PathProgramCache]: Analyzing trace with hash 896150570, now seen corresponding path program 1 times [2024-11-23 23:04:55,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:04:55,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [943401431] [2024-11-23 23:04:55,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:04:55,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:55,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:04:55,022 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:04:55,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 23:04:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:04:55,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 23:04:55,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:04:55,186 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-23 23:04:55,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:04:55,187 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:04:55,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943401431] [2024-11-23 23:04:55,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943401431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:04:55,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:04:55,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:04:55,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102444776] [2024-11-23 23:04:55,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:04:55,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:04:55,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:04:55,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:04:55,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:04:55,189 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-23 23:04:55,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:04:55,439 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-23 23:04:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:04:55,440 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-23 23:04:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:04:55,441 INFO L225 Difference]: With dead ends: 69 [2024-11-23 23:04:55,441 INFO L226 Difference]: Without dead ends: 69 [2024-11-23 23:04:55,441 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-23 23:04:55,442 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-23 23:04:55,442 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-23 23:04:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-23 23:04:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-23 23:04:55,448 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-23 23:04:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-23 23:04:55,449 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 17 [2024-11-23 23:04:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:04:55,449 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-23 23:04:55,449 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-23 23:04:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-23 23:04:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-23 23:04:55,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:04:55,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:04:55,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-23 23:04:55,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:55,654 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-23 23:04:55,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:04:55,654 INFO L85 PathProgramCache]: Analyzing trace with hash 896150571, now seen corresponding path program 1 times [2024-11-23 23:04:55,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:04:55,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758700153] [2024-11-23 23:04:55,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:04:55,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:55,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:04:55,656 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:04:55,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 23:04:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:04:55,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 23:04:55,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:04:55,808 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-23 23:04:55,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:04:55,917 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-23 23:04:55,917 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:04:55,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758700153] [2024-11-23 23:04:55,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758700153] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:04:55,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:04:55,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-23 23:04:55,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929129579] [2024-11-23 23:04:55,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:04:55,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:04:55,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:04:55,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:04:55,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:04:55,919 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-23 23:04:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:04:55,967 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-23 23:04:55,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:04:55,968 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-23 23:04:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:04:55,968 INFO L225 Difference]: With dead ends: 87 [2024-11-23 23:04:55,968 INFO L226 Difference]: Without dead ends: 87 [2024-11-23 23:04:55,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:04:55,969 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-23 23:04:55,970 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-23 23:04:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-23 23:04:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-23 23:04:55,977 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-23 23:04:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-23 23:04:55,978 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 17 [2024-11-23 23:04:55,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:04:55,978 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-23 23:04:55,978 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-23 23:04:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-23 23:04:55,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-23 23:04:55,983 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:04:55,983 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:04:55,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-23 23:04:56,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:56,183 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-23 23:04:56,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:04:56,184 INFO L85 PathProgramCache]: Analyzing trace with hash -372257531, now seen corresponding path program 1 times [2024-11-23 23:04:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:04:56,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1520863891] [2024-11-23 23:04:56,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:04:56,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:04:56,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:04:56,186 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:04:56,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-23 23:04:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:04:56,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-23 23:04:56,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:04:56,337 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-23 23:04:56,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:04:56,482 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-23 23:04:56,502 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-23 23:04:56,503 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-23 23:04:56,539 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-23 23:04:56,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:05:01,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:01,064 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-23 23:05:01,234 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-23 23:05:01,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:05:01,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520863891] [2024-11-23 23:05:01,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520863891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:05:01,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:05:01,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-23 23:05:01,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726397717] [2024-11-23 23:05:01,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:05:01,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 23:05:01,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:05:01,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 23:05:01,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2024-11-23 23:05:01,237 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-23 23:05:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:05:02,211 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-23 23:05:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:05:02,212 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-23 23:05:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:05:02,213 INFO L225 Difference]: With dead ends: 83 [2024-11-23 23:05:02,213 INFO L226 Difference]: Without dead ends: 83 [2024-11-23 23:05:02,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=35, Invalid=74, Unknown=1, NotChecked=0, Total=110 [2024-11-23 23:05:02,214 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 8 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:05:02,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 234 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-23 23:05:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-23 23:05:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-23 23:05:02,217 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-23 23:05:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2024-11-23 23:05:02,218 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 20 [2024-11-23 23:05:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:05:02,218 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-11-23 23:05:02,218 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-23 23:05:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2024-11-23 23:05:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-23 23:05:02,219 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:05:02,219 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-23 23:05:02,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-23 23:05:02,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:02,420 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-23 23:05:02,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:05:02,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1339800399, now seen corresponding path program 1 times [2024-11-23 23:05:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:05:02,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2146894398] [2024-11-23 23:05:02,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:05:02,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:02,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:05:02,423 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:05:02,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-23 23:05:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:05:02,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 23:05:02,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:05:02,604 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-23 23:05:02,698 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-23 23:05:02,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:05:02,698 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:05:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146894398] [2024-11-23 23:05:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146894398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:05:02,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:05:02,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:05:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048988164] [2024-11-23 23:05:02,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:05:02,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:05:02,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:05:02,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:05:02,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:05:02,699 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-23 23:05:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:05:03,293 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-23 23:05:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:05:03,294 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-23 23:05:03,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:05:03,294 INFO L225 Difference]: With dead ends: 80 [2024-11-23 23:05:03,295 INFO L226 Difference]: Without dead ends: 80 [2024-11-23 23:05:03,295 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-23 23:05:03,295 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 18 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:05:03,296 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.6s Time] [2024-11-23 23:05:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-23 23:05:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-23 23:05:03,299 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-23 23:05:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-23 23:05:03,299 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 41 [2024-11-23 23:05:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:05:03,299 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-23 23:05:03,300 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-23 23:05:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-23 23:05:03,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-23 23:05:03,300 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:05:03,300 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-23 23:05:03,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-23 23:05:03,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:03,501 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-23 23:05:03,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:05:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1339800400, now seen corresponding path program 1 times [2024-11-23 23:05:03,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:05:03,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45183829] [2024-11-23 23:05:03,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:05:03,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:03,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:05:03,503 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:05:03,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-23 23:05:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:05:03,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-23 23:05:03,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:05:03,713 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-23 23:05:03,873 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-23 23:05:03,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:05:03,874 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:05:03,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45183829] [2024-11-23 23:05:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45183829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:05:03,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:05:03,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:05:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948750880] [2024-11-23 23:05:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:05:03,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:05:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:05:03,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:05:03,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:05:03,876 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-23 23:05:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:05:04,475 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-23 23:05:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:05:04,475 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-23 23:05:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:05:04,476 INFO L225 Difference]: With dead ends: 87 [2024-11-23 23:05:04,476 INFO L226 Difference]: Without dead ends: 87 [2024-11-23 23:05:04,476 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-23 23:05:04,477 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-23 23:05:04,477 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-23 23:05:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-23 23:05:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-11-23 23:05:04,480 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-23 23:05:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-11-23 23:05:04,481 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 41 [2024-11-23 23:05:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:05:04,481 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-11-23 23:05:04,481 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-23 23:05:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-11-23 23:05:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-23 23:05:04,482 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:05:04,482 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-23 23:05:04,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-23 23:05:04,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:04,686 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-23 23:05:04,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:05:04,687 INFO L85 PathProgramCache]: Analyzing trace with hash 972300203, now seen corresponding path program 1 times [2024-11-23 23:05:04,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:05:04,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2022996971] [2024-11-23 23:05:04,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:05:04,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:04,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:05:04,689 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:05:04,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-23 23:05:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:05:04,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-23 23:05:04,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:05:05,354 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-23 23:05:05,355 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-23 23:05:05,469 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-23 23:05:05,531 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-23 23:05:05,661 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-23 23:05:05,713 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-23 23:05:05,838 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-23 23:05:05,879 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-23 23:05:05,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:05:06,059 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-23 23:05:06,114 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-23 23:05:06,182 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-23 23:05:06,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:06,212 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-23 23:05:06,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:06,245 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-23 23:05:07,842 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-23 23:05:07,843 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-23 23:05:07,918 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-23 23:05:08,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:08,071 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-23 23:05:08,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:08,212 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-23 23:05:08,299 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-23 23:05:08,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:08,827 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-23 23:05:09,126 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-23 23:05:09,127 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:05:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022996971] [2024-11-23 23:05:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022996971] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:05:09,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:05:09,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-11-23 23:05:09,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505811010] [2024-11-23 23:05:09,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:05:09,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-23 23:05:09,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:05:09,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-23 23:05:09,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=330, Unknown=3, NotChecked=114, Total=506 [2024-11-23 23:05:09,129 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-23 23:05:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:05:11,169 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-23 23:05:11,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:05:11,170 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-23 23:05:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:05:11,171 INFO L225 Difference]: With dead ends: 83 [2024-11-23 23:05:11,171 INFO L226 Difference]: Without dead ends: 83 [2024-11-23 23:05:11,172 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-23 23:05:11,172 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:05:11,173 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.5s Time] [2024-11-23 23:05:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-23 23:05:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-23 23:05:11,175 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-23 23:05:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2024-11-23 23:05:11,176 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 45 [2024-11-23 23:05:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:05:11,176 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-11-23 23:05:11,176 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-23 23:05:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2024-11-23 23:05:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-23 23:05:11,178 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:05:11,179 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-23 23:05:11,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-23 23:05:11,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:11,379 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-23 23:05:11,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:05:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1919567614, now seen corresponding path program 1 times [2024-11-23 23:05:11,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:05:11,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [735277363] [2024-11-23 23:05:11,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:05:11,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:11,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:05:11,382 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:05:11,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-23 23:05:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:05:11,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-23 23:05:11,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:05:11,771 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-23 23:05:11,771 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-23 23:05:11,841 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-23 23:05:11,890 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-23 23:05:11,942 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 23:05:11,942 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-23 23:05:12,114 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-23 23:05:12,115 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-23 23:05:12,314 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-23 23:05:12,315 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-23 23:05:12,933 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-23 23:05:12,934 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-23 23:05:13,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:13,018 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-23 23:05:13,301 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-23 23:05:13,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:05:13,791 INFO L349 Elim1Store]: treesize reduction 24, result has 68.0 percent of original size [2024-11-23 23:05:13,791 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-23 23:05:13,838 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-23 23:05:13,908 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-23 23:05:13,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:13,942 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-23 23:05:13,962 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-23 23:05:13,998 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:05:14,199 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-23 23:05:14,200 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:05:14,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735277363] [2024-11-23 23:05:14,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735277363] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:05:14,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:05:14,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2024-11-23 23:05:14,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829072049] [2024-11-23 23:05:14,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:05:14,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-23 23:05:14,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:05:14,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-23 23:05:14,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=486, Unknown=2, NotChecked=90, Total=650 [2024-11-23 23:05:14,202 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-23 23:05:17,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:05:17,626 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-11-23 23:05:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-23 23:05:17,627 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-23 23:05:17,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:05:17,628 INFO L225 Difference]: With dead ends: 87 [2024-11-23 23:05:17,628 INFO L226 Difference]: Without dead ends: 87 [2024-11-23 23:05:17,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=193, Invalid=935, Unknown=2, NotChecked=130, Total=1260 [2024-11-23 23:05:17,629 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 27 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:05:17,629 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.4s Time] [2024-11-23 23:05:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-23 23:05:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-23 23:05:17,631 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-23 23:05:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-11-23 23:05:17,632 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 47 [2024-11-23 23:05:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:05:17,632 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-11-23 23:05:17,633 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-23 23:05:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-11-23 23:05:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-23 23:05:17,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:05:17,634 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-23 23:05:17,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-23 23:05:17,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:17,838 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-23 23:05:17,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:05:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1919567613, now seen corresponding path program 1 times [2024-11-23 23:05:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:05:17,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260101424] [2024-11-23 23:05:17,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:05:17,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:17,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:05:17,841 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:05:17,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-23 23:05:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:05:18,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-23 23:05:18,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:05:18,159 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-23 23:05:18,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-23 23:05:18,309 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2024-11-23 23:05:18,309 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-23 23:05:18,340 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-23 23:05:18,619 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 23:05:18,619 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-23 23:05:18,654 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2024-11-23 23:05:18,654 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-23 23:05:18,722 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-23 23:05:18,733 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-23 23:05:18,799 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-23 23:05:18,819 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-23 23:05:18,855 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 23:05:18,855 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-23 23:05:18,863 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-23 23:05:19,032 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-23 23:05:19,046 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-23 23:05:19,102 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-23 23:05:19,130 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-23 23:05:19,292 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-23 23:05:19,299 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-23 23:05:19,319 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-23 23:05:19,328 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-23 23:05:19,428 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-23 23:05:19,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:05:20,297 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-23 23:05:20,827 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-23 23:05:20,853 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-23 23:05:20,863 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-23 23:05:20,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 40 treesize of output 32 [2024-11-23 23:05:20,877 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-23 23:05:20,909 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-23 23:05:20,916 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-23 23:05:20,962 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-23 23:05:20,972 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-23 23:05:21,002 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-23 23:05:31,053 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-23 23:05:31,053 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-23 23:05:31,070 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-23 23:05:31,070 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:05:31,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260101424] [2024-11-23 23:05:31,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260101424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:05:31,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:05:31,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2024-11-23 23:05:31,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762511559] [2024-11-23 23:05:31,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:05:31,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-23 23:05:31,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:05:31,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-23 23:05:31,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=806, Unknown=23, NotChecked=118, Total=1056 [2024-11-23 23:05:31,072 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-23 23:05:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:05:36,551 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-23 23:05:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-23 23:05:36,552 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-23 23:05:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:05:36,553 INFO L225 Difference]: With dead ends: 93 [2024-11-23 23:05:36,553 INFO L226 Difference]: Without dead ends: 93 [2024-11-23 23:05:36,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=243, Invalid=1301, Unknown=24, NotChecked=154, Total=1722 [2024-11-23 23:05:36,555 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 61 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:05:36,555 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.7s Time] [2024-11-23 23:05:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-23 23:05:36,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-23 23:05:36,558 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-23 23:05:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-23 23:05:36,559 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 47 [2024-11-23 23:05:36,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:05:36,559 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-23 23:05:36,560 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-23 23:05:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-23 23:05:36,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-23 23:05:36,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:05:36,560 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-23 23:05:36,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-23 23:05:36,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:36,761 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-23 23:05:36,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:05:36,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2131544921, now seen corresponding path program 1 times [2024-11-23 23:05:36,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:05:36,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1702017845] [2024-11-23 23:05:36,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:05:36,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:36,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:05:36,765 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:05:36,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-23 23:05:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:05:36,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 23:05:36,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:05:36,979 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-23 23:05:37,103 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-23 23:05:37,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:05:37,103 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:05:37,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702017845] [2024-11-23 23:05:37,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702017845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:05:37,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:05:37,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:05:37,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29375280] [2024-11-23 23:05:37,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:05:37,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:05:37,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:05:37,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:05:37,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:05:37,104 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-23 23:05:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:05:37,599 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-23 23:05:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:05:37,600 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-23 23:05:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:05:37,600 INFO L225 Difference]: With dead ends: 92 [2024-11-23 23:05:37,600 INFO L226 Difference]: Without dead ends: 92 [2024-11-23 23:05:37,600 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-23 23:05:37,601 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.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:05:37,601 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.5s Time] [2024-11-23 23:05:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-23 23:05:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-11-23 23:05:37,604 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-23 23:05:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-23 23:05:37,605 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 49 [2024-11-23 23:05:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:05:37,605 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-23 23:05:37,605 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-23 23:05:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-23 23:05:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-23 23:05:37,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:05:37,606 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-23 23:05:37,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-23 23:05:37,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:37,807 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-23 23:05:37,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:05:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2131544922, now seen corresponding path program 1 times [2024-11-23 23:05:37,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:05:37,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991813480] [2024-11-23 23:05:37,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:05:37,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:37,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:05:37,810 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:05:37,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-23 23:05:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:05:38,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 23:05:38,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:05:38,022 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-23 23:05:38,225 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-23 23:05:38,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:05:38,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:05:38,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991813480] [2024-11-23 23:05:38,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991813480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:05:38,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:05:38,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:05:38,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214795064] [2024-11-23 23:05:38,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:05:38,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:05:38,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:05:38,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:05:38,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:05:38,226 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-23 23:05:38,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:05:38,765 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-23 23:05:38,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:05:38,766 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-23 23:05:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:05:38,766 INFO L225 Difference]: With dead ends: 91 [2024-11-23 23:05:38,766 INFO L226 Difference]: Without dead ends: 91 [2024-11-23 23:05:38,767 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-23 23:05:38,767 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-23 23:05:38,767 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-23 23:05:38,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-23 23:05:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-23 23:05:38,770 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-23 23:05:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-23 23:05:38,771 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 49 [2024-11-23 23:05:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:05:38,771 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-23 23:05:38,772 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-23 23:05:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-23 23:05:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-23 23:05:38,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:05:38,772 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-23 23:05:38,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-23 23:05:38,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:38,973 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-23 23:05:38,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:05:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash -364770338, now seen corresponding path program 1 times [2024-11-23 23:05:38,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:05:38,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1863717334] [2024-11-23 23:05:38,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:05:38,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:05:38,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:05:38,978 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:05:38,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd58de72-f388-4fe1-ab55-3909f6eefa8b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-23 23:05:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:05:39,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-23 23:05:39,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:05:39,515 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-23 23:05:39,515 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-23 23:05:39,825 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-23 23:05:39,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-23 23:05:40,046 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-23 23:05:40,153 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-23 23:05:40,363 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-23 23:05:40,363 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-23 23:05:40,480 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-23 23:05:40,509 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-23 23:05:40,520 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-23 23:05:40,618 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-23 23:05:40,653 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-23 23:05:40,665 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-23 23:05:40,721 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 23:05:40,722 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-23 23:05:40,733 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-23 23:05:40,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 39 treesize of output 15 [2024-11-23 23:05:41,008 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-23 23:05:41,009 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-23 23:05:41,041 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-23 23:05:41,041 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-23 23:05:41,054 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-23 23:05:41,314 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-23 23:05:41,315 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-23 23:05:41,412 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2024-11-23 23:05:41,412 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-23 23:05:41,424 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-23 23:05:41,424 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-23 23:05:42,272 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-23 23:05:42,272 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-23 23:05:42,283 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-23 23:05:42,284 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-23 23:05:42,364 INFO L349 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2024-11-23 23:05:42,364 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-23 23:05:42,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:42,710 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-23 23:05:42,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:42,742 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-23 23:05:43,336 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-23 23:05:43,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:05:44,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:44,111 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-23 23:05:44,128 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-23 23:05:45,002 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-23 23:05:45,607 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-23 23:05:46,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:46,366 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-23 23:05:46,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:46,489 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-23 23:05:46,529 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-23 23:05:46,543 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-23 23:05:46,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:46,763 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-23 23:05:46,816 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-23 23:05:47,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:47,509 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-23 23:05:47,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:47,535 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-23 23:05:47,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:47,561 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-23 23:05:47,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:47,733 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-23 23:05:48,218 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-23 23:05:48,246 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-23 23:05:48,605 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-23 23:05:50,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse3 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))) (.cse10 (= (_ bv0 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse4 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (.cse5 (not .cse10)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (and (= |c_ULTIMATE.start_main_~data_init~0#1| (_ bv1 32)) .cse10)) (.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_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|))) (= (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| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 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_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |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 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_1263 .cse3 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))))) (.cse7 (not .cse9))) (and (or .cse0 .cse1) (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|) (= |c_ULTIMATE.start_dll_circular_create_~head~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 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 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_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (or .cse4 (let ((.cse8 (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 (= |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_~head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))))))) (and (or (let ((.cse6 (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 (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_~head~0#1.base| v_arrayElimArr_3) v_prenex_46) v_prenex_45)))))) (and (or .cse5 .cse6) (or .cse7 .cse6) (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_prenex_46 (_ 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_~head~0#1.base| v_arrayElimArr_3) v_prenex_46) v_prenex_45))) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse1) (or (and (or .cse5 .cse8) (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (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_~head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)))))) .cse9 .cse1) (or .cse10 .cse7 .cse8) (or .cse9 .cse8)))) (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_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 (= (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| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 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_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (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 .cse3 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 (and (or .cse4 (and (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_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_~head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113))))) (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 (= |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_~head~0#1.base| v_arrayElimArr_3) v_arrayElimCell_112) v_arrayElimCell_113)) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))) (= (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse1))) (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 (= (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| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 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_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |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 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_1263 .cse3 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_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (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_dll_circular_create_~head~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_~head~0#1.base| (store .cse2 .cse3 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_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))))) (or (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_dll_circular_create_~head~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_~head~0#1.base| (store .cse2 .cse3 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_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) .cse10)) .cse9) (or (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (or .cse9 .cse1 (and .cse5 (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_arrayElimCell_114)) |c_ULTIMATE.start_dll_circular_create_~last~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|) |c_ULTIMATE.start_main_~data_init~0#1|)) (not (= (_ bv1 32) (select v_arrayElimArr_3 (_ bv0 32)))))))) (or .cse1 (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_~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_~head~0#1.base| (store .cse2 .cse3 (select v_arrayElimArr_4 .cse3))) |c_ULTIMATE.start_dll_circular_create_~last~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 (and .cse5 (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_~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)))))) .cse7))))) (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 (= (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| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1263) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 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_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_1263 .cse3 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 (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|))) (= |c_ULTIMATE.start_dll_circular_create_~head~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 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 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_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) .cse9 .cse1) (or .cse0 .cse10 .cse7)))) is different from false [2024-11-23 23:05:52,090 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-23 23:05:52,878 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-23 23:05:55,431 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 23:05:55,432 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-23 23:05:55,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:55,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 262 treesize of output 260 [2024-11-23 23:05:55,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:55,617 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-23 23:05:55,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:55,701 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-23 23:05:55,734 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-23 23:05:55,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:55,780 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-23 23:05:58,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:05:58,065 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-23 23:05:58,091 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-23 23:05:58,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:58,125 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-23 23:05:58,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:58,219 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-23 23:05:58,242 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-23 23:05:58,685 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 23:05:58,685 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-23 23:05:58,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:58,747 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-23 23:05:58,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:58,864 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-23 23:05:58,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:58,955 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-23 23:05:58,994 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-23 23:05:59,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:05:59,049 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-23 23:06:00,206 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-23 23:06:00,219 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-23 23:06:00,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 53 treesize of output 51 [2024-11-23 23:06:00,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:00,256 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-23 23:06:00,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 50 treesize of output 46 [2024-11-23 23:06:00,364 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-23 23:06:00,374 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-23 23:06:00,385 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-23 23:06:00,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:00,410 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-23 23:06:00,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:00,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:00,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:00,498 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-23 23:06:00,520 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-23 23:06:00,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-23 23:06:00,547 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:00,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:00,692 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 23:06:00,693 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-23 23:06:00,721 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-23 23:06:00,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:00,768 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-23 23:06:00,792 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:00,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:00,839 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-23 23:06:00,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 136 treesize of output 132 [2024-11-23 23:06:00,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:00,933 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-23 23:06:01,544 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:01,544 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:01,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:01,556 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-23 23:06:01,596 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-23 23:06:01,604 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-23 23:06:01,621 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-23 23:06:01,628 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-23 23:06:01,633 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:01,634 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:01,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:01,650 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-23 23:06:01,659 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-23 23:06:01,678 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-23 23:06:01,705 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:01,706 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:01,846 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-23 23:06:01,846 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-23 23:06:01,876 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-23 23:06:01,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:01,927 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-23 23:06:01,951 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:02,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:02,023 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-23 23:06:02,078 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-23 23:06:02,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:02,137 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-23 23:06:02,493 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:02,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:02,505 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-23 23:06:02,512 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-23 23:06:02,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 36 treesize of output 28 [2024-11-23 23:06:02,540 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-23 23:06:02,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:02,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:02,597 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-23 23:06:02,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-23 23:06:02,616 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-23 23:06:02,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:02,654 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:06:02,677 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2024-11-23 23:06:02,677 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-23 23:06:05,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:06:05,360 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