./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/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_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI --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.2.4-dev-0e0057c [2023-11-24 21:51:54,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:51:54,594 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:51:54,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:51:54,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:51:54,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:51:54,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:51:54,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:51:54,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:51:54,655 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:51:54,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:51:54,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:51:54,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:51:54,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:51:54,660 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:51:54,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:51:54,661 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:51:54,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:51:54,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:51:54,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:51:54,663 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:51:54,663 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:51:54,664 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:51:54,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:51:54,664 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:51:54,665 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:51:54,665 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:51:54,666 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:51:54,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:51:54,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:51:54,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:51:54,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:51:54,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:51:54,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:51:54,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:51:54,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:51:54,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:51:54,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:51:54,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:51:54,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:51:54,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:51:54,671 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI 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 [2023-11-24 21:51:54,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:51:55,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:51:55,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:51:55,033 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:51:55,033 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:51:55,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-11-24 21:51:58,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:51:58,457 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:51:58,458 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-11-24 21:51:58,474 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/data/be759bbc7/7b4240be2fa247e9a96dbcba9b981b15/FLAG197c2f029 [2023-11-24 21:51:58,489 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/data/be759bbc7/7b4240be2fa247e9a96dbcba9b981b15 [2023-11-24 21:51:58,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:51:58,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:51:58,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:51:58,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:51:58,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:51:58,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:58,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8121a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58, skipping insertion in model container [2023-11-24 21:51:58,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:58,549 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:51:58,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:51:58,917 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:51:58,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:51:58,993 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:51:58,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58 WrapperNode [2023-11-24 21:51:58,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:51:58,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:51:58,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:51:58,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:51:59,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:59,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:59,041 INFO L138 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2023-11-24 21:51:59,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:51:59,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:51:59,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:51:59,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:51:59,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:59,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:59,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:59,107 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]. [2023-11-24 21:51:59,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:59,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:59,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:59,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:59,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:59,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:59,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:51:59,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:51:59,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:51:59,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:51:59,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (1/1) ... [2023-11-24 21:51:59,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:51:59,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:51:59,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:51:59,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:51:59,214 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-24 21:51:59,215 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-24 21:51:59,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 21:51:59,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 21:51:59,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:51:59,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:51:59,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 21:51:59,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:51:59,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-24 21:51:59,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-24 21:51:59,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-24 21:51:59,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-24 21:51:59,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:51:59,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:51:59,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:51:59,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:51:59,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:51:59,361 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:51:59,364 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:51:59,399 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-24 21:51:59,759 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:51:59,832 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:51:59,832 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-24 21:51:59,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:51:59 BoogieIcfgContainer [2023-11-24 21:51:59,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:51:59,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:51:59,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:51:59,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:51:59,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:51:58" (1/3) ... [2023-11-24 21:51:59,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3050108b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:51:59, skipping insertion in model container [2023-11-24 21:51:59,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:58" (2/3) ... [2023-11-24 21:51:59,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3050108b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:51:59, skipping insertion in model container [2023-11-24 21:51:59,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:51:59" (3/3) ... [2023-11-24 21:51:59,851 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2023-11-24 21:51:59,868 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:51:59,869 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-11-24 21:51:59,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:51:59,931 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@62146850, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:51:59,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2023-11-24 21:51:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 71 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:51:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-24 21:51:59,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:59,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-24 21:51:59,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:51:59,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:59,953 INFO L85 PathProgramCache]: Analyzing trace with hash 179165, now seen corresponding path program 1 times [2023-11-24 21:51:59,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702241888] [2023-11-24 21:51:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:59,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:00,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:00,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702241888] [2023-11-24 21:52:00,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702241888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:00,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:00,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:52:00,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596489859] [2023-11-24 21:52:00,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:00,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:52:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:00,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:52:00,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:00,328 INFO L87 Difference]: Start difference. First operand has 73 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 71 states have internal predecessors, (81), 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 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:00,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:00,464 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2023-11-24 21:52:00,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:52:00,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-11-24 21:52:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:00,474 INFO L225 Difference]: With dead ends: 68 [2023-11-24 21:52:00,475 INFO L226 Difference]: Without dead ends: 63 [2023-11-24 21:52:00,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:00,484 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 23 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:00,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-24 21:52:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-24 21:52:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 32 states have (on average 2.0625) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2023-11-24 21:52:00,527 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 3 [2023-11-24 21:52:00,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:00,528 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2023-11-24 21:52:00,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2023-11-24 21:52:00,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-24 21:52:00,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:00,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-24 21:52:00,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:52:00,531 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:00,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:00,533 INFO L85 PathProgramCache]: Analyzing trace with hash 179166, now seen corresponding path program 1 times [2023-11-24 21:52:00,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:00,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720719079] [2023-11-24 21:52:00,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:00,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:00,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:00,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720719079] [2023-11-24 21:52:00,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720719079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:00,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:00,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:52:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649586747] [2023-11-24 21:52:00,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:00,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:52:00,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:00,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:52:00,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:00,698 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:00,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:00,766 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2023-11-24 21:52:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:52:00,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-11-24 21:52:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:00,768 INFO L225 Difference]: With dead ends: 59 [2023-11-24 21:52:00,768 INFO L226 Difference]: Without dead ends: 59 [2023-11-24 21:52:00,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:00,770 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:00,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 70 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-24 21:52:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-24 21:52:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.9375) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2023-11-24 21:52:00,777 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 3 [2023-11-24 21:52:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:00,778 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2023-11-24 21:52:00,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2023-11-24 21:52:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 21:52:00,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:00,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:00,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:52:00,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:00,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:00,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1143413123, now seen corresponding path program 1 times [2023-11-24 21:52:00,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:00,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481652177] [2023-11-24 21:52:00,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:00,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:00,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:00,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481652177] [2023-11-24 21:52:00,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481652177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:00,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:00,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:52:00,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768468284] [2023-11-24 21:52:00,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:00,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:52:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:00,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:52:00,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:00,867 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:00,928 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2023-11-24 21:52:00,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:52:00,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-11-24 21:52:00,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:00,930 INFO L225 Difference]: With dead ends: 57 [2023-11-24 21:52:00,930 INFO L226 Difference]: Without dead ends: 57 [2023-11-24 21:52:00,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:00,932 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:00,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-24 21:52:00,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-24 21:52:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.875) internal successors, (60), 56 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2023-11-24 21:52:00,940 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 8 [2023-11-24 21:52:00,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:00,940 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2023-11-24 21:52:00,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2023-11-24 21:52:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 21:52:00,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:00,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:00,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:52:00,942 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:00,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:00,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1143413124, now seen corresponding path program 1 times [2023-11-24 21:52:00,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:00,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781891326] [2023-11-24 21:52:00,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:00,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:01,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:01,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781891326] [2023-11-24 21:52:01,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781891326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:01,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:01,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:52:01,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837193184] [2023-11-24 21:52:01,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:01,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:52:01,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:01,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:52:01,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:01,087 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:01,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:01,171 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2023-11-24 21:52:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:52:01,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-11-24 21:52:01,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:01,173 INFO L225 Difference]: With dead ends: 55 [2023-11-24 21:52:01,174 INFO L226 Difference]: Without dead ends: 55 [2023-11-24 21:52:01,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:01,178 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:01,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 76 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-24 21:52:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-24 21:52:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.8125) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2023-11-24 21:52:01,184 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 8 [2023-11-24 21:52:01,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:01,184 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2023-11-24 21:52:01,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2023-11-24 21:52:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 21:52:01,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:01,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:01,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:52:01,186 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:01,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:01,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1143411682, now seen corresponding path program 1 times [2023-11-24 21:52:01,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:01,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174118629] [2023-11-24 21:52:01,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:01,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:01,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:01,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174118629] [2023-11-24 21:52:01,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174118629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:01,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:01,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:52:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049963849] [2023-11-24 21:52:01,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:01,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:52:01,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:01,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:52:01,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:01,280 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:01,306 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2023-11-24 21:52:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:52:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-11-24 21:52:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:01,308 INFO L225 Difference]: With dead ends: 62 [2023-11-24 21:52:01,308 INFO L226 Difference]: Without dead ends: 62 [2023-11-24 21:52:01,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:01,309 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:01,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 94 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:52:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-24 21:52:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2023-11-24 21:52:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2023-11-24 21:52:01,316 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 8 [2023-11-24 21:52:01,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:01,317 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2023-11-24 21:52:01,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2023-11-24 21:52:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-24 21:52:01,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:01,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:01,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:52:01,318 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:01,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash -691616122, now seen corresponding path program 1 times [2023-11-24 21:52:01,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:01,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491490768] [2023-11-24 21:52:01,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:01,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:01,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491490768] [2023-11-24 21:52:01,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491490768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:01,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:01,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:52:01,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664648590] [2023-11-24 21:52:01,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:01,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:52:01,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:01,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:52:01,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:52:01,512 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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) [2023-11-24 21:52:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:01,604 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2023-11-24 21:52:01,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:52:01,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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 [2023-11-24 21:52:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:01,606 INFO L225 Difference]: With dead ends: 61 [2023-11-24 21:52:01,606 INFO L226 Difference]: Without dead ends: 61 [2023-11-24 21:52:01,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:01,607 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:01,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 89 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:01,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-24 21:52:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-11-24 21:52:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-11-24 21:52:01,613 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 10 [2023-11-24 21:52:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:01,613 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-11-24 21:52:01,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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) [2023-11-24 21:52:01,614 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-11-24 21:52:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-24 21:52:01,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:01,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:01,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:52:01,615 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:01,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:01,615 INFO L85 PathProgramCache]: Analyzing trace with hash -691616121, now seen corresponding path program 1 times [2023-11-24 21:52:01,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:01,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090139265] [2023-11-24 21:52:01,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:01,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:01,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:01,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090139265] [2023-11-24 21:52:01,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090139265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:01,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:01,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:52:01,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122045424] [2023-11-24 21:52:01,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:01,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:01,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:01,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:01,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:01,818 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2023-11-24 21:52:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:01,938 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2023-11-24 21:52:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:52:01,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 [2023-11-24 21:52:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:01,939 INFO L225 Difference]: With dead ends: 60 [2023-11-24 21:52:01,940 INFO L226 Difference]: Without dead ends: 60 [2023-11-24 21:52:01,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:52:01,941 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:01,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 112 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-24 21:52:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-24 21:52:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 59 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2023-11-24 21:52:01,946 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 10 [2023-11-24 21:52:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:01,947 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2023-11-24 21:52:01,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2023-11-24 21:52:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2023-11-24 21:52:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 21:52:01,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:01,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:01,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:52:01,948 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:01,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:01,949 INFO L85 PathProgramCache]: Analyzing trace with hash -974641803, now seen corresponding path program 1 times [2023-11-24 21:52:01,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:01,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599204310] [2023-11-24 21:52:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:02,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:02,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599204310] [2023-11-24 21:52:02,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599204310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:02,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:02,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:52:02,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902904965] [2023-11-24 21:52:02,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:02,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:52:02,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:02,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:52:02,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:52:02,069 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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) [2023-11-24 21:52:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:02,151 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2023-11-24 21:52:02,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:52:02,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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 [2023-11-24 21:52:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:02,153 INFO L225 Difference]: With dead ends: 58 [2023-11-24 21:52:02,153 INFO L226 Difference]: Without dead ends: 58 [2023-11-24 21:52:02,153 INFO L412 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 [2023-11-24 21:52:02,157 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:02,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 92 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-24 21:52:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-24 21:52:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2023-11-24 21:52:02,166 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 13 [2023-11-24 21:52:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:02,169 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2023-11-24 21:52:02,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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) [2023-11-24 21:52:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2023-11-24 21:52:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 21:52:02,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:02,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:02,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:52:02,172 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:02,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:02,173 INFO L85 PathProgramCache]: Analyzing trace with hash -974641802, now seen corresponding path program 1 times [2023-11-24 21:52:02,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:02,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541217431] [2023-11-24 21:52:02,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:02,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:02,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:02,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541217431] [2023-11-24 21:52:02,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541217431] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:02,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058240266] [2023-11-24 21:52:02,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:02,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:02,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:02,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:02,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 21:52:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:02,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:52:02,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:02,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058240266] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:02,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:02,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-24 21:52:02,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480455661] [2023-11-24 21:52:02,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:02,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:02,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:02,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:02,575 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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) [2023-11-24 21:52:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:02,619 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2023-11-24 21:52:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:52:02,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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 13 [2023-11-24 21:52:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:02,621 INFO L225 Difference]: With dead ends: 71 [2023-11-24 21:52:02,621 INFO L226 Difference]: Without dead ends: 71 [2023-11-24 21:52:02,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:02,622 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 12 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:02,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 137 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:52:02,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-24 21:52:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2023-11-24 21:52:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 68 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) [2023-11-24 21:52:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2023-11-24 21:52:02,628 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 13 [2023-11-24 21:52:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:02,629 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2023-11-24 21:52:02,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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) [2023-11-24 21:52:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2023-11-24 21:52:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-24 21:52:02,630 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:02,630 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:02,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:02,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-24 21:52:02,837 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:02,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash -326516902, now seen corresponding path program 1 times [2023-11-24 21:52:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:02,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415930007] [2023-11-24 21:52:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:02,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:03,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415930007] [2023-11-24 21:52:03,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415930007] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:03,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185643804] [2023-11-24 21:52:03,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:03,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:03,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:03,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:03,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 21:52:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:03,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-24 21:52:03,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:03,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 21:52:03,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 21:52:03,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:52:03,421 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 [2023-11-24 21:52:03,438 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:52:03,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 21:52:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:03,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:03,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185643804] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:03,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:03,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2023-11-24 21:52:03,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160099869] [2023-11-24 21:52:03,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:03,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 21:52:03,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:03,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 21:52:03,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-24 21:52:03,765 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:04,025 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2023-11-24 21:52:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:52:04,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-24 21:52:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:04,026 INFO L225 Difference]: With dead ends: 67 [2023-11-24 21:52:04,026 INFO L226 Difference]: Without dead ends: 67 [2023-11-24 21:52:04,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-24 21:52:04,027 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:04,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 182 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 21:52:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-24 21:52:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-24 21:52:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2023-11-24 21:52:04,033 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 15 [2023-11-24 21:52:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:04,033 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2023-11-24 21:52:04,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2023-11-24 21:52:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-24 21:52:04,035 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:04,035 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:04,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:04,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-24 21:52:04,236 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:04,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1239858367, now seen corresponding path program 1 times [2023-11-24 21:52:04,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:04,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214151852] [2023-11-24 21:52:04,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:04,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-24 21:52:04,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:04,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214151852] [2023-11-24 21:52:04,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214151852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:04,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:04,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:52:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180657361] [2023-11-24 21:52:04,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:04,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:52:04,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:04,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:52:04,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:52:04,451 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:04,555 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2023-11-24 21:52:04,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:52:04,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-24 21:52:04,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:04,557 INFO L225 Difference]: With dead ends: 65 [2023-11-24 21:52:04,557 INFO L226 Difference]: Without dead ends: 65 [2023-11-24 21:52:04,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:04,558 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:04,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 72 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-24 21:52:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2023-11-24 21:52:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2023-11-24 21:52:04,574 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 29 [2023-11-24 21:52:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:04,574 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2023-11-24 21:52:04,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2023-11-24 21:52:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-24 21:52:04,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:04,576 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:04,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:52:04,576 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:04,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1239858368, now seen corresponding path program 1 times [2023-11-24 21:52:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:04,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182880651] [2023-11-24 21:52:04,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:04,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-24 21:52:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:04,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182880651] [2023-11-24 21:52:04,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182880651] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:04,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:04,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:52:04,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364819640] [2023-11-24 21:52:04,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:04,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:52:04,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:04,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:52:04,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:52:04,890 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:04,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:04,998 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2023-11-24 21:52:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:52:04,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-24 21:52:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:04,999 INFO L225 Difference]: With dead ends: 71 [2023-11-24 21:52:04,999 INFO L226 Difference]: Without dead ends: 71 [2023-11-24 21:52:05,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:05,000 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:05,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 120 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-24 21:52:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2023-11-24 21:52:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 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) [2023-11-24 21:52:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-11-24 21:52:05,004 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 29 [2023-11-24 21:52:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:05,005 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-11-24 21:52:05,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-11-24 21:52:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-24 21:52:05,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:05,007 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:05,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:52:05,007 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:05,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:05,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1254125787, now seen corresponding path program 1 times [2023-11-24 21:52:05,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:05,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850677920] [2023-11-24 21:52:05,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:05,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-24 21:52:05,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:05,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850677920] [2023-11-24 21:52:05,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850677920] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:05,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785073654] [2023-11-24 21:52:05,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:05,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:05,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:05,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:05,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 21:52:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:06,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-24 21:52:06,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:06,278 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 21:52:06,278 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 [2023-11-24 21:52:06,425 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-11-24 21:52:06,425 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 33 [2023-11-24 21:52:06,631 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-24 21:52:06,631 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 [2023-11-24 21:52:06,713 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 [2023-11-24 21:52:06,770 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 [2023-11-24 21:52:06,828 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 [2023-11-24 21:52:06,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-24 21:52:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:06,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:06,938 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_846 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_846) |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|)) is different from false [2023-11-24 21:52:07,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:07,028 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 [2023-11-24 21:52:07,033 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 [2023-11-24 21:52:07,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-24 21:52:07,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-11-24 21:52:07,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:07,821 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 131 treesize of output 201 [2023-11-24 21:52:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-24 21:52:08,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785073654] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:08,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:08,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 33 [2023-11-24 21:52:08,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758790029] [2023-11-24 21:52:08,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:08,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-24 21:52:08,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:08,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-24 21:52:08,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=924, Unknown=11, NotChecked=62, Total=1122 [2023-11-24 21:52:08,070 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 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) [2023-11-24 21:52:08,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:08,843 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2023-11-24 21:52:08,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:52:08,843 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 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) Word has length 33 [2023-11-24 21:52:08,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:08,844 INFO L225 Difference]: With dead ends: 67 [2023-11-24 21:52:08,844 INFO L226 Difference]: Without dead ends: 67 [2023-11-24 21:52:08,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=295, Invalid=1338, Unknown=11, NotChecked=78, Total=1722 [2023-11-24 21:52:08,846 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:08,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 576 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 479 Invalid, 0 Unknown, 27 Unchecked, 0.4s Time] [2023-11-24 21:52:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-24 21:52:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-24 21:52:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2023-11-24 21:52:08,854 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 33 [2023-11-24 21:52:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:08,854 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2023-11-24 21:52:08,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 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) [2023-11-24 21:52:08,855 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2023-11-24 21:52:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-24 21:52:08,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:08,856 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:08,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:09,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-24 21:52:09,057 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:09,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:09,057 INFO L85 PathProgramCache]: Analyzing trace with hash 223358434, now seen corresponding path program 1 times [2023-11-24 21:52:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:09,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933425272] [2023-11-24 21:52:09,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:09,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-24 21:52:09,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:09,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933425272] [2023-11-24 21:52:09,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933425272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:09,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:09,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:52:09,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216708216] [2023-11-24 21:52:09,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:09,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:52:09,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:09,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:52:09,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:52:09,282 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:09,386 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2023-11-24 21:52:09,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:52:09,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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 34 [2023-11-24 21:52:09,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:09,387 INFO L225 Difference]: With dead ends: 69 [2023-11-24 21:52:09,387 INFO L226 Difference]: Without dead ends: 69 [2023-11-24 21:52:09,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:52:09,388 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 61 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:09,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 66 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-24 21:52:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2023-11-24 21:52:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2023-11-24 21:52:09,391 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 34 [2023-11-24 21:52:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:09,392 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2023-11-24 21:52:09,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2023-11-24 21:52:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-24 21:52:09,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:09,393 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:09,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:52:09,394 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:09,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash 223358435, now seen corresponding path program 1 times [2023-11-24 21:52:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:09,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474463613] [2023-11-24 21:52:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:09,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-24 21:52:09,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:09,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474463613] [2023-11-24 21:52:09,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474463613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:09,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:09,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:52:09,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033017829] [2023-11-24 21:52:09,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:09,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:52:09,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:09,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:52:09,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:52:09,760 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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) [2023-11-24 21:52:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:09,915 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2023-11-24 21:52:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:52:09,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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 34 [2023-11-24 21:52:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:09,917 INFO L225 Difference]: With dead ends: 67 [2023-11-24 21:52:09,917 INFO L226 Difference]: Without dead ends: 67 [2023-11-24 21:52:09,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:52:09,918 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 28 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:09,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 83 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-24 21:52:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2023-11-24 21:52:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2023-11-24 21:52:09,921 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 34 [2023-11-24 21:52:09,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:09,921 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2023-11-24 21:52:09,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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) [2023-11-24 21:52:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2023-11-24 21:52:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-24 21:52:09,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:09,926 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:09,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:52:09,926 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:09,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:09,927 INFO L85 PathProgramCache]: Analyzing trace with hash 223358472, now seen corresponding path program 1 times [2023-11-24 21:52:09,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:09,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443627511] [2023-11-24 21:52:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:09,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:52:11,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:11,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443627511] [2023-11-24 21:52:11,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443627511] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:11,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192905446] [2023-11-24 21:52:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:11,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:11,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:11,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 21:52:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:11,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-24 21:52:11,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:11,408 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 21:52:11,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 21:52:11,448 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-24 21:52:11,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-24 21:52:11,512 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-24 21:52:11,512 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 [2023-11-24 21:52:11,544 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 [2023-11-24 21:52:11,582 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 25 treesize of output 13 [2023-11-24 21:52:11,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:52:11,608 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 [2023-11-24 21:52:11,685 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 [2023-11-24 21:52:11,761 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2023-11-24 21:52:11,765 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 41 treesize of output 25 [2023-11-24 21:52:11,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:52:11,943 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 37 treesize of output 19 [2023-11-24 21:52:11,966 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:11,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:11,969 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 31 treesize of output 16 [2023-11-24 21:52:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:52:11,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:12,214 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-11-24 21:52:12,215 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 29 treesize of output 28 [2023-11-24 21:52:12,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:12,445 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 33 treesize of output 39 [2023-11-24 21:52:12,454 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 90 treesize of output 86 [2023-11-24 21:52:12,461 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:12,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2023-11-24 21:52:12,469 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:12,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:12,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2023-11-24 21:52:12,508 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:12,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-24 21:52:12,858 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-24 21:52:12,858 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 [2023-11-24 21:52:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 27 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:52:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192905446] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:12,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:12,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2023-11-24 21:52:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726266544] [2023-11-24 21:52:12,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:12,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-24 21:52:12,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-24 21:52:12,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1033, Unknown=24, NotChecked=0, Total=1190 [2023-11-24 21:52:12,870 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 35 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) [2023-11-24 21:52:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:13,606 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2023-11-24 21:52:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:52:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 35 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) Word has length 34 [2023-11-24 21:52:13,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:13,608 INFO L225 Difference]: With dead ends: 67 [2023-11-24 21:52:13,608 INFO L226 Difference]: Without dead ends: 67 [2023-11-24 21:52:13,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=1431, Unknown=24, NotChecked=0, Total=1722 [2023-11-24 21:52:13,610 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 58 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:13,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 237 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 21:52:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-24 21:52:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2023-11-24 21:52:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2023-11-24 21:52:13,612 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 34 [2023-11-24 21:52:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:13,613 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2023-11-24 21:52:13,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 35 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) [2023-11-24 21:52:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2023-11-24 21:52:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-24 21:52:13,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:13,614 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:13,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:13,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-24 21:52:13,823 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:13,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:13,824 INFO L85 PathProgramCache]: Analyzing trace with hash 223358473, now seen corresponding path program 1 times [2023-11-24 21:52:13,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:13,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989451897] [2023-11-24 21:52:13,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:13,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:52:15,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:15,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989451897] [2023-11-24 21:52:15,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989451897] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:15,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754568876] [2023-11-24 21:52:15,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:15,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:15,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:15,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:15,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 21:52:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:15,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 76 conjunts are in the unsatisfiable core [2023-11-24 21:52:15,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:15,802 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-24 21:52:15,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-24 21:52:15,881 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 21:52:15,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-24 21:52:16,016 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-24 21:52:16,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-24 21:52:16,080 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 [2023-11-24 21:52:16,091 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 [2023-11-24 21:52:16,157 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 [2023-11-24 21:52:16,167 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 [2023-11-24 21:52:16,203 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:52:16,203 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 [2023-11-24 21:52:16,209 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 [2023-11-24 21:52:16,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-24 21:52:16,303 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 [2023-11-24 21:52:16,361 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 [2023-11-24 21:52:16,370 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 [2023-11-24 21:52:16,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:16,451 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 30 treesize of output 21 [2023-11-24 21:52:16,462 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 [2023-11-24 21:52:16,479 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 [2023-11-24 21:52:16,485 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 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 21:52:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:52:16,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:16,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:16,759 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 55 treesize of output 59 [2023-11-24 21:52:17,014 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 158 treesize of output 156 [2023-11-24 21:52:17,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 20 [2023-11-24 21:52:17,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 9 treesize of output 5 [2023-11-24 21:52:17,039 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:17,039 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:17,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-24 21:52:17,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:17,052 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 1 case distinctions, treesize of input 14 treesize of output 8 [2023-11-24 21:52:17,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-24 21:52:17,064 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-24 21:52:17,064 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2023-11-24 21:52:17,451 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2023-11-24 21:52:17,451 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 22 treesize of output 22 [2023-11-24 21:52:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:52:17,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754568876] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:17,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:17,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 34 [2023-11-24 21:52:17,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193153694] [2023-11-24 21:52:17,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:17,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-24 21:52:17,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:17,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-24 21:52:17,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1060, Unknown=4, NotChecked=0, Total=1190 [2023-11-24 21:52:17,501 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 35 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 35 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) [2023-11-24 21:52:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:18,979 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2023-11-24 21:52:18,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 21:52:18,980 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 35 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) Word has length 34 [2023-11-24 21:52:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:18,981 INFO L225 Difference]: With dead ends: 72 [2023-11-24 21:52:18,981 INFO L226 Difference]: Without dead ends: 72 [2023-11-24 21:52:18,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=294, Invalid=1682, Unknown=4, NotChecked=0, Total=1980 [2023-11-24 21:52:18,983 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 68 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:18,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 307 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-24 21:52:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-24 21:52:18,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2023-11-24 21:52:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.263157894736842) internal successors, (72), 66 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) [2023-11-24 21:52:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2023-11-24 21:52:18,986 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 34 [2023-11-24 21:52:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:18,987 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2023-11-24 21:52:18,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 35 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) [2023-11-24 21:52:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2023-11-24 21:52:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-24 21:52:18,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:18,988 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:18,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:19,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-24 21:52:19,195 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:19,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:19,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1168908210, now seen corresponding path program 1 times [2023-11-24 21:52:19,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:19,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107545818] [2023-11-24 21:52:19,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:19,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:20,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:20,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107545818] [2023-11-24 21:52:20,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107545818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:20,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574191359] [2023-11-24 21:52:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:20,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:20,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:20,414 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:20,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 21:52:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:20,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-24 21:52:20,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:20,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 21:52:20,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:52:20,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-24 21:52:20,901 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 17 treesize of output 9 [2023-11-24 21:52:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-24 21:52:20,923 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:52:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574191359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:20,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 21:52:20,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 23 [2023-11-24 21:52:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994957433] [2023-11-24 21:52:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:20,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:52:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:20,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:52:20,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-11-24 21:52:20,928 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:21,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:21,209 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2023-11-24 21:52:21,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:52:21,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-24 21:52:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:21,210 INFO L225 Difference]: With dead ends: 76 [2023-11-24 21:52:21,211 INFO L226 Difference]: Without dead ends: 76 [2023-11-24 21:52:21,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2023-11-24 21:52:21,212 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:21,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 122 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 21:52:21,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-24 21:52:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2023-11-24 21:52:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2023-11-24 21:52:21,215 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 37 [2023-11-24 21:52:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:21,215 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2023-11-24 21:52:21,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2023-11-24 21:52:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-24 21:52:21,216 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:21,216 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:21,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:21,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-24 21:52:21,427 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:21,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1168908211, now seen corresponding path program 1 times [2023-11-24 21:52:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:21,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391053630] [2023-11-24 21:52:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:52:22,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:22,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391053630] [2023-11-24 21:52:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391053630] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:22,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93398911] [2023-11-24 21:52:22,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:22,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:22,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:22,670 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:22,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-24 21:52:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:23,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-24 21:52:23,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:23,081 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 21:52:23,081 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 [2023-11-24 21:52:23,152 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-24 21:52:23,153 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 [2023-11-24 21:52:23,261 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-24 21:52:23,261 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 [2023-11-24 21:52:23,304 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 [2023-11-24 21:52:23,340 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 [2023-11-24 21:52:23,367 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:52:23,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-24 21:52:23,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-24 21:52:23,448 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 24 treesize of output 12 [2023-11-24 21:52:23,501 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 24 treesize of output 12 [2023-11-24 21:52:23,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-24 21:52:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:23,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:23,643 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2100 (Array Int Int)) (v_ArrVal_2099 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2099) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2100) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))))) is different from false [2023-11-24 21:52:23,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:23,722 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 29 treesize of output 35 [2023-11-24 21:52:23,725 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 149 treesize of output 131 [2023-11-24 21:52:23,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 4 [2023-11-24 21:52:23,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 4 [2023-11-24 21:52:23,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 4 [2023-11-24 21:52:24,108 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-24 21:52:24,109 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 61 treesize of output 60 [2023-11-24 21:52:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 28 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-24 21:52:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93398911] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:24,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 36 [2023-11-24 21:52:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428985408] [2023-11-24 21:52:24,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:24,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-24 21:52:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:24,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-24 21:52:24,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1027, Unknown=18, NotChecked=66, Total=1260 [2023-11-24 21:52:24,139 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 36 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 36 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) [2023-11-24 21:52:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:24,739 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2023-11-24 21:52:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:52:24,740 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 36 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) Word has length 37 [2023-11-24 21:52:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:24,740 INFO L225 Difference]: With dead ends: 71 [2023-11-24 21:52:24,740 INFO L226 Difference]: Without dead ends: 71 [2023-11-24 21:52:24,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=293, Invalid=1333, Unknown=18, NotChecked=78, Total=1722 [2023-11-24 21:52:24,742 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:24,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 449 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 428 Invalid, 0 Unknown, 34 Unchecked, 0.3s Time] [2023-11-24 21:52:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-24 21:52:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2023-11-24 21:52:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 66 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) [2023-11-24 21:52:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-11-24 21:52:24,745 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 37 [2023-11-24 21:52:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:24,745 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-11-24 21:52:24,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 36 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) [2023-11-24 21:52:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-11-24 21:52:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-24 21:52:24,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:24,746 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:24,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:24,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:24,947 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-24 21:52:24,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1846416804, now seen corresponding path program 1 times [2023-11-24 21:52:24,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:24,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103172826] [2023-11-24 21:52:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:24,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:27,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:27,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103172826] [2023-11-24 21:52:27,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103172826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:27,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882571061] [2023-11-24 21:52:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:27,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:27,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:27,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:27,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e579f1c3-8477-4347-a7e6-2f64a96675d0/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-24 21:52:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:27,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-24 21:52:27,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:27,796 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-24 21:52:27,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-24 21:52:27,890 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-24 21:52:27,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-11-24 21:52:28,039 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 [2023-11-24 21:52:28,129 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 [2023-11-24 21:52:28,185 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-24 21:52:28,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-24 21:52:28,257 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 [2023-11-24 21:52:28,265 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 [2023-11-24 21:52:28,278 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 [2023-11-24 21:52:28,383 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 [2023-11-24 21:52:28,394 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 [2023-11-24 21:52:28,405 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 [2023-11-24 21:52:28,455 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:52:28,455 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 [2023-11-24 21:52:28,461 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 [2023-11-24 21:52:28,469 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 [2023-11-24 21:52:28,532 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 [2023-11-24 21:52:28,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-24 21:52:28,547 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 [2023-11-24 21:52:28,627 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 35 treesize of output 19 [2023-11-24 21:52:28,633 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 20 treesize of output 15 [2023-11-24 21:52:28,646 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 [2023-11-24 21:52:28,788 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 30 treesize of output 21 [2023-11-24 21:52:28,802 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 35 treesize of output 19 [2023-11-24 21:52:28,810 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 20 treesize of output 15 [2023-11-24 21:52:28,832 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 27 treesize of output 15 [2023-11-24 21:52:28,841 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 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 21:52:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:28,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:29,247 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2366) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2359) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2359) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2366) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2023-11-24 21:52:29,322 WARN L854 $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|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2354) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (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 .cse0 .cse1 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366) .cse2) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2359) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2359) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (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 .cse0 .cse1 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2354) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) .cse4)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse4)))))) is different from false [2023-11-24 21:52:29,454 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_2351 (Array Int Int))) (or (forall ((v_ArrVal_2353 Int) (v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2351) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2359) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse0) (= (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366) (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_2353)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2354) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2351 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2351)))) (forall ((v_ArrVal_2351 (Array Int Int))) (or (forall ((v_ArrVal_2353 Int) (v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse5 (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_2353)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2354) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse5) (= (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366) .cse5) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2351) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2359) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2351 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2351)))))) is different from false [2023-11-24 21:52:29,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:29,493 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 66 treesize of output 72 [2023-11-24 21:52:29,503 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 222 treesize of output 210 [2023-11-24 21:52:29,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2023-11-24 21:52:29,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-11-24 21:52:29,543 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 1411 treesize of output 1409 [2023-11-24 21:52:29,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 96 [2023-11-24 21:52:29,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 158 [2023-11-24 21:52:30,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:30,239 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 95 treesize of output 87 [2023-11-24 21:52:30,246 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 573 treesize of output 543 [2023-11-24 21:52:30,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 133 treesize of output 117 [2023-11-24 21:52:30,280 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 1318 treesize of output 1316 [2023-11-24 21:52:30,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2023-11-24 21:52:30,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2023-11-24 21:52:30,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2023-11-24 21:52:35,096 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse15 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse34 (forall ((v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_130 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_arrayElimCell_129 Int)) (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| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366) v_arrayElimCell_129) v_arrayElimCell_130) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_129 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse20 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (not .cse15)) (.cse32 (forall ((v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_121 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_arrayElimCell_124 Int) (v_ArrVal_2352 (Array Int Int))) (let ((.cse44 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 |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| (select (select .cse44 v_arrayElimCell_121) v_arrayElimCell_124)))))) (.cse14 (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (= |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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (.cse5 (not .cse6))) (let ((.cse18 (forall ((v_arrayElimCell_125 Int)) (or (forall ((v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_122 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (= (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366) v_arrayElimCell_122) v_arrayElimCell_125) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_125)))) (.cse25 (or (forall ((v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_122 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_arrayElimCell_125 Int) (v_ArrVal_2352 (Array Int Int))) (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| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366) v_arrayElimCell_122) v_arrayElimCell_125) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_125))) .cse5)) (.cse21 (forall ((v_arrayElimCell_125 Int)) (or (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (let ((.cse43 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (forall ((v_arrayElimCell_122 Int)) (= (select (select .cse43 v_arrayElimCell_122) v_arrayElimCell_125) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_125)))) (.cse22 (or .cse6 .cse14)) (.cse23 (or .cse32 .cse6)) (.cse28 (or .cse3 (forall ((v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_121 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_arrayElimCell_124 Int) (v_ArrVal_2352 (Array Int Int))) (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366) v_arrayElimCell_121) v_arrayElimCell_124)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_124))))) (.cse29 (forall ((v_arrayElimCell_124 Int)) (or (forall ((v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_121 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (let ((.cse42 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 |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| (select (select .cse42 v_arrayElimCell_121) v_arrayElimCell_124))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_124)))) (.cse30 (and .cse20 .cse3)) (.cse7 (or .cse34 .cse3)) (.cse9 (or .cse15 .cse14)) (.cse16 (forall ((v_arrayElimCell_129 Int)) (or (forall ((v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_130 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (let ((.cse41 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= (select (select .cse41 v_arrayElimCell_129) v_arrayElimCell_130) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (= v_arrayElimCell_129 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse0 (forall ((v_arrayElimCell_127 Int)) (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (= |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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366) v_arrayElimCell_127) v_arrayElimCell_131))) (= v_arrayElimCell_127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse11 (forall ((v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_130 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_arrayElimCell_129 Int)) (let ((.cse40 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= (select (select .cse40 v_arrayElimCell_129) v_arrayElimCell_130) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (.cse4 (forall ((v_arrayElimCell_127 Int)) (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_130 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_arrayElimCell_129 Int)) (let ((.cse39 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 v_arrayElimCell_127) v_arrayElimCell_131)) (= (select (select .cse39 v_arrayElimCell_129) v_arrayElimCell_130) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (= v_arrayElimCell_127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (and (or (and .cse0 (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_130 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_arrayElimCell_127 Int) (v_arrayElimCell_129 Int)) (let ((.cse1 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse1 v_arrayElimCell_127) v_arrayElimCell_131)) (= (select (select .cse1 v_arrayElimCell_129) v_arrayElimCell_130) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse3) .cse4) .cse5) (or .cse6 (let ((.cse13 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_arrayElimCell_127 Int)) (let ((.cse17 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse17 v_arrayElimCell_127) v_arrayElimCell_131)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (and .cse7 (forall ((v_arrayElimCell_127 Int) (v_arrayElimCell_129 Int)) (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_130 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (let ((.cse8 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse8 v_arrayElimCell_127) v_arrayElimCell_131)) (= (select (select .cse8 v_arrayElimCell_129) v_arrayElimCell_130) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (= v_arrayElimCell_129 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse9 (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_130 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_arrayElimCell_127 Int) (v_arrayElimCell_129 Int)) (let ((.cse10 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse10 v_arrayElimCell_127) v_arrayElimCell_131)) (= (select (select .cse10 v_arrayElimCell_129) v_arrayElimCell_130) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_129 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse3) (or (and .cse11 (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_130 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_arrayElimCell_127 Int) (v_arrayElimCell_129 Int)) (let ((.cse12 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse12 v_arrayElimCell_127) v_arrayElimCell_131)) (= (select (select .cse12 v_arrayElimCell_129) v_arrayElimCell_130) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) .cse13 .cse14) .cse15) .cse16 (or .cse15 .cse13)))) (or (and .cse18 (or (forall ((v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_122 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_arrayElimCell_125 Int) (v_ArrVal_2352 (Array Int Int))) (let ((.cse19 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= (select (select .cse19 v_arrayElimCell_122) v_arrayElimCell_125) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_125)))) .cse15)) .cse5) (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_arrayElimCell_127 Int)) (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366) v_arrayElimCell_127) v_arrayElimCell_131)) (= v_arrayElimCell_127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse5) (or (and (or .cse20 (and .cse21 .cse22 .cse23 (or .cse6 (forall ((v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_121 Int) (v_arrayElimCell_124 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (let ((.cse24 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse24 |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| (select (select .cse24 v_arrayElimCell_121) v_arrayElimCell_124)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_124))))) .cse25)) (or (and .cse21 .cse18) .cse5)) .cse15) (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_arrayElimCell_127 Int)) (let ((.cse26 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 v_arrayElimCell_127) v_arrayElimCell_131)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= v_arrayElimCell_127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse15) (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_130 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_arrayElimCell_127 Int) (v_arrayElimCell_129 Int)) (let ((.cse27 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse27 v_arrayElimCell_127) v_arrayElimCell_131)) (= (select (select .cse27 v_arrayElimCell_129) v_arrayElimCell_130) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_arrayElimCell_129 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse3) (or (and (or .cse6 (and .cse28 .cse29)) (or .cse15 (and .cse21 .cse22)) .cse25 (or .cse15 (and .cse21 .cse22 .cse23))) .cse30) (or .cse6 (let ((.cse31 (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_arrayElimCell_125 Int) (v_ArrVal_2352 (Array Int Int))) (let ((.cse33 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (forall ((v_arrayElimCell_122 Int)) (= (select (select .cse33 v_arrayElimCell_122) v_arrayElimCell_125) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (and .cse28 (or .cse15 (and .cse31 .cse14)) .cse29 (or (and .cse32 .cse31 .cse14) .cse15))) .cse30) (or .cse6 (and .cse7 .cse9 .cse16)) (or .cse3 (and (or (and .cse34 .cse16) .cse6) (or (and .cse0 (forall ((v_arrayElimCell_127 Int)) (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_130 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_arrayElimCell_129 Int)) (let ((.cse35 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_arrayElimCell_127) v_arrayElimCell_131)) (= (select (select .cse35 v_arrayElimCell_129) v_arrayElimCell_130) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse4) .cse5) (forall ((v_arrayElimCell_127 Int)) (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_130 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_arrayElimCell_129 Int)) (let ((.cse36 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 v_arrayElimCell_127) v_arrayElimCell_131)) (= (select (select .cse36 v_arrayElimCell_129) v_arrayElimCell_130) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_129 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (= v_arrayElimCell_127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (forall ((v_arrayElimCell_127 Int)) (or (= v_arrayElimCell_127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_arrayElimCell_129 Int)) (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_arrayElimCell_130 Int) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (let ((.cse37 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse37 v_arrayElimCell_127) v_arrayElimCell_131)) (= (select (select .cse37 v_arrayElimCell_129) v_arrayElimCell_130) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (= v_arrayElimCell_129 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or .cse15 (and (or .cse6 (and .cse11 .cse14)) (forall ((v_arrayElimCell_127 Int)) (or (forall ((v_arrayElimCell_131 Int) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (let ((.cse38 (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_2352) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_2357)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2366))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse38 v_arrayElimCell_127) v_arrayElimCell_131)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (= v_arrayElimCell_127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse4)))))) is different from false