./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya --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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:49:54,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:49:54,703 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 03:49:54,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:49:54,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:49:54,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:49:54,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:49:54,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:49:54,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:49:54,741 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:49:54,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:49:54,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:49:54,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:49:54,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:49:54,745 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:49:54,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:49:54,746 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:49:54,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:49:54,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:49:54,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:49:54,749 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:49:54,751 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:49:54,752 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:49:54,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:49:54,753 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:49:54,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:49:54,754 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:49:54,755 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:49:54,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:49:54,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:49:54,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:49:54,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:49:54,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:49:54,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:49:54,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:49:54,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:49:54,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:49:54,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:49:54,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:49:54,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:49:54,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:49:54,759 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_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/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_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2023-11-29 03:49:55,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:49:55,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:49:55,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:49:55,069 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:49:55,070 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:49:55,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2023-11-29 03:49:58,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:49:58,745 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:49:58,746 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2023-11-29 03:49:58,763 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/data/062314e07/5241172745534c6287b28f537062181d/FLAG791cf77ea [2023-11-29 03:49:58,782 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/data/062314e07/5241172745534c6287b28f537062181d [2023-11-29 03:49:58,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:49:58,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:49:58,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:49:58,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:49:58,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:49:58,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:49:58" (1/1) ... [2023-11-29 03:49:58,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737fd547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:58, skipping insertion in model container [2023-11-29 03:49:58,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:49:58" (1/1) ... [2023-11-29 03:49:58,854 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:49:59,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:49:59,233 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:49:59,289 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:49:59,328 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:49:59,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59 WrapperNode [2023-11-29 03:49:59,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:49:59,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:49:59,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:49:59,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:49:59,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (1/1) ... [2023-11-29 03:49:59,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (1/1) ... [2023-11-29 03:49:59,384 INFO L138 Inliner]: procedures = 127, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 158 [2023-11-29 03:49:59,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:49:59,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:49:59,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:49:59,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:49:59,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (1/1) ... [2023-11-29 03:49:59,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (1/1) ... [2023-11-29 03:49:59,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (1/1) ... [2023-11-29 03:49:59,429 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2023-11-29 03:49:59,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (1/1) ... [2023-11-29 03:49:59,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (1/1) ... [2023-11-29 03:49:59,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (1/1) ... [2023-11-29 03:49:59,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (1/1) ... [2023-11-29 03:49:59,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (1/1) ... [2023-11-29 03:49:59,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (1/1) ... [2023-11-29 03:49:59,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:49:59,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:49:59,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:49:59,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:49:59,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (1/1) ... [2023-11-29 03:49:59,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:49:59,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:49:59,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:49:59,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:49:59,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:49:59,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:49:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 03:49:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:49:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:49:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:49:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 03:49:59,545 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 03:49:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:49:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:49:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:49:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:49:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:49:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:49:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:49:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:49:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:49:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:49:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 03:49:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 03:49:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 03:49:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:49:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:49:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:49:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:49:59,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:49:59,733 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:49:59,735 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:50:00,234 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:50:00,284 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:50:00,285 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 03:50:00,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:50:00 BoogieIcfgContainer [2023-11-29 03:50:00,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:50:00,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:50:00,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:50:00,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:50:00,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:49:58" (1/3) ... [2023-11-29 03:50:00,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bbaf6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:50:00, skipping insertion in model container [2023-11-29 03:50:00,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:59" (2/3) ... [2023-11-29 03:50:00,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bbaf6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:50:00, skipping insertion in model container [2023-11-29 03:50:00,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:50:00" (3/3) ... [2023-11-29 03:50:00,296 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2023-11-29 03:50:00,315 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:50:00,316 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-11-29 03:50:00,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:50:00,378 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;@3112e03a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:50:00,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-11-29 03:50:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 58 states have (on average 2.3448275862068964) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 03:50:00,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:00,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:50:00,391 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:00,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 246683571, now seen corresponding path program 1 times [2023-11-29 03:50:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:00,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596720723] [2023-11-29 03:50:00,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:00,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:00,679 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-29 03:50:00,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:00,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596720723] [2023-11-29 03:50:00,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596720723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:00,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:00,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:50:00,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362537109] [2023-11-29 03:50:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:00,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:00,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:00,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:00,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:50:00,729 INFO L87 Difference]: Start difference. First operand has 127 states, 58 states have (on average 2.3448275862068964) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:50:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:00,938 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2023-11-29 03:50:00,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:00,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 03:50:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:00,952 INFO L225 Difference]: With dead ends: 123 [2023-11-29 03:50:00,953 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 03:50:00,955 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-29 03:50:00,960 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:00,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 176 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:50:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 03:50:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-29 03:50:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 56 states have (on average 2.2142857142857144) internal successors, (124), 116 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2023-11-29 03:50:01,018 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 5 [2023-11-29 03:50:01,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:01,019 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2023-11-29 03:50:01,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:50:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2023-11-29 03:50:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 03:50:01,020 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:01,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:50:01,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:50:01,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:01,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:01,022 INFO L85 PathProgramCache]: Analyzing trace with hash 246683572, now seen corresponding path program 1 times [2023-11-29 03:50:01,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:01,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034417322] [2023-11-29 03:50:01,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:01,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:01,165 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-29 03:50:01,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:01,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034417322] [2023-11-29 03:50:01,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034417322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:01,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:01,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:50:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620707755] [2023-11-29 03:50:01,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:01,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:01,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:01,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:50:01,170 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:50:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:01,324 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2023-11-29 03:50:01,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:01,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 03:50:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:01,330 INFO L225 Difference]: With dead ends: 118 [2023-11-29 03:50:01,330 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 03:50:01,330 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-29 03:50:01,332 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:01,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 181 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:50:01,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 03:50:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-29 03:50:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2023-11-29 03:50:01,347 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 5 [2023-11-29 03:50:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:01,347 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2023-11-29 03:50:01,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:50:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2023-11-29 03:50:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 03:50:01,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:01,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:01,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:50:01,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:01,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:01,350 INFO L85 PathProgramCache]: Analyzing trace with hash 438481457, now seen corresponding path program 1 times [2023-11-29 03:50:01,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:01,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600467850] [2023-11-29 03:50:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:01,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:01,613 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-29 03:50:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600467850] [2023-11-29 03:50:01,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600467850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:01,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:01,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:50:01,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350523760] [2023-11-29 03:50:01,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:01,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:01,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:01,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:01,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:01,619 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:50:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:02,022 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2023-11-29 03:50:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:50:02,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-29 03:50:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:02,026 INFO L225 Difference]: With dead ends: 122 [2023-11-29 03:50:02,027 INFO L226 Difference]: Without dead ends: 122 [2023-11-29 03:50:02,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:50:02,029 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:02,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 376 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:50:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-29 03:50:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2023-11-29 03:50:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 58 states have (on average 2.1551724137931036) internal successors, (125), 115 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2023-11-29 03:50:02,045 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 11 [2023-11-29 03:50:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:02,046 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2023-11-29 03:50:02,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:50:02,046 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2023-11-29 03:50:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 03:50:02,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:02,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:02,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:50:02,048 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:02,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash 438481458, now seen corresponding path program 1 times [2023-11-29 03:50:02,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:02,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096996088] [2023-11-29 03:50:02,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:02,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:02,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:02,164 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-29 03:50:02,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:02,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096996088] [2023-11-29 03:50:02,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096996088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:02,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:02,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:50:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837396690] [2023-11-29 03:50:02,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:02,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:50:02,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:02,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:50:02,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:50:02,168 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:50:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:02,355 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2023-11-29 03:50:02,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:50:02,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-29 03:50:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:02,358 INFO L225 Difference]: With dead ends: 119 [2023-11-29 03:50:02,358 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 03:50:02,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:50:02,360 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 10 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:02,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 249 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:50:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 03:50:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-29 03:50:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 57 states have (on average 2.1403508771929824) internal successors, (122), 114 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2023-11-29 03:50:02,372 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 11 [2023-11-29 03:50:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:02,373 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2023-11-29 03:50:02,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:50:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2023-11-29 03:50:02,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:50:02,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:02,375 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:02,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:50:02,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:02,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash 617829281, now seen corresponding path program 1 times [2023-11-29 03:50:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:02,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102814936] [2023-11-29 03:50:02,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:02,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:02,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:02,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:50:02,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:02,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102814936] [2023-11-29 03:50:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102814936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:02,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:02,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:50:02,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119584123] [2023-11-29 03:50:02,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:02,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:02,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:02,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:02,576 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:50:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:02,926 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2023-11-29 03:50:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:50:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-29 03:50:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:02,929 INFO L225 Difference]: With dead ends: 118 [2023-11-29 03:50:02,929 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 03:50:02,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:50:02,931 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 9 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:02,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 370 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:50:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 03:50:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-29 03:50:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2023-11-29 03:50:02,941 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 19 [2023-11-29 03:50:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:02,942 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2023-11-29 03:50:02,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:50:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2023-11-29 03:50:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:50:02,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:02,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:02,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:50:02,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:02,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:02,944 INFO L85 PathProgramCache]: Analyzing trace with hash 617829282, now seen corresponding path program 1 times [2023-11-29 03:50:02,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:02,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781796098] [2023-11-29 03:50:02,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:02,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:03,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:03,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:50:03,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:03,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781796098] [2023-11-29 03:50:03,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781796098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:03,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:03,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:50:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540838940] [2023-11-29 03:50:03,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:03,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:03,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:03,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:03,274 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:50:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:03,607 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2023-11-29 03:50:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:50:03,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-29 03:50:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:03,609 INFO L225 Difference]: With dead ends: 117 [2023-11-29 03:50:03,610 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 03:50:03,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:50:03,611 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 7 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:03,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 394 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:50:03,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 03:50:03,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-11-29 03:50:03,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 112 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2023-11-29 03:50:03,621 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 19 [2023-11-29 03:50:03,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:03,621 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2023-11-29 03:50:03,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:50:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2023-11-29 03:50:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:50:03,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:03,623 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:03,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:50:03,623 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:03,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:03,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1028451906, now seen corresponding path program 1 times [2023-11-29 03:50:03,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:03,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122030511] [2023-11-29 03:50:03,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:03,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:50:04,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122030511] [2023-11-29 03:50:04,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122030511] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223805839] [2023-11-29 03:50:04,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:04,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:04,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:04,028 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:04,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:50:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:04,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 03:50:04,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:04,285 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-29 03:50:04,398 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:50:04,399 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-29 03:50:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:04,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223805839] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:50:04,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:50:04,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-11-29 03:50:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771893298] [2023-11-29 03:50:04,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:04,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 03:50:04,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:04,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 03:50:04,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:50:04,872 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 19 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 03:50:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:05,512 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2023-11-29 03:50:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:50:05,513 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-11-29 03:50:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:05,514 INFO L225 Difference]: With dead ends: 124 [2023-11-29 03:50:05,515 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 03:50:05,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2023-11-29 03:50:05,516 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 11 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:05,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 645 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:50:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 03:50:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2023-11-29 03:50:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 116 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:50:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2023-11-29 03:50:05,526 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 21 [2023-11-29 03:50:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:05,526 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2023-11-29 03:50:05,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 03:50:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2023-11-29 03:50:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:50:05,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:05,527 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:05,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:50:05,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:05,734 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:05,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1028451907, now seen corresponding path program 1 times [2023-11-29 03:50:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:05,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21056626] [2023-11-29 03:50:05,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:05,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:06,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:50:06,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:06,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21056626] [2023-11-29 03:50:06,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21056626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510719407] [2023-11-29 03:50:06,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:06,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:06,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:06,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:06,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:50:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:06,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 03:50:06,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:06,290 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-29 03:50:06,538 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:50:06,538 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-29 03:50:06,557 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:50:06,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 03:50:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:06,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510719407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:06,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:50:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-11-29 03:50:06,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116498365] [2023-11-29 03:50:06,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:06,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 03:50:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:06,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 03:50:06,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2023-11-29 03:50:06,771 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 18 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:50:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:07,576 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2023-11-29 03:50:07,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:50:07,577 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2023-11-29 03:50:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:07,578 INFO L225 Difference]: With dead ends: 124 [2023-11-29 03:50:07,578 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 03:50:07,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2023-11-29 03:50:07,579 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:07,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 901 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:50:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 03:50:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2023-11-29 03:50:07,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 116 states have internal predecessors, (125), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:50:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2023-11-29 03:50:07,585 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 21 [2023-11-29 03:50:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:07,585 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2023-11-29 03:50:07,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:50:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2023-11-29 03:50:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 03:50:07,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:07,586 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:07,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:50:07,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:07,791 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:07,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:07,792 INFO L85 PathProgramCache]: Analyzing trace with hash 499957720, now seen corresponding path program 1 times [2023-11-29 03:50:07,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:07,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798397083] [2023-11-29 03:50:07,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:07,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:07,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:50:07,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:07,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798397083] [2023-11-29 03:50:07,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798397083] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204999720] [2023-11-29 03:50:07,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:07,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:07,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:07,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:07,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:50:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:08,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 03:50:08,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:50:08,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:50:08,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204999720] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:50:08,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:50:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-29 03:50:08,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880142351] [2023-11-29 03:50:08,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:08,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:08,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:08,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:08,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:08,165 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:50:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:08,336 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2023-11-29 03:50:08,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:50:08,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-11-29 03:50:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:08,338 INFO L225 Difference]: With dead ends: 123 [2023-11-29 03:50:08,338 INFO L226 Difference]: Without dead ends: 123 [2023-11-29 03:50:08,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:50:08,339 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:08,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 557 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:50:08,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-29 03:50:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2023-11-29 03:50:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 116 states have internal predecessors, (124), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:50:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2023-11-29 03:50:08,344 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 23 [2023-11-29 03:50:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:08,344 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2023-11-29 03:50:08,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:50:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2023-11-29 03:50:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:50:08,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:08,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:08,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 03:50:08,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:08,552 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:08,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1685960527, now seen corresponding path program 1 times [2023-11-29 03:50:08,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:08,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506850383] [2023-11-29 03:50:08,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:08,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:08,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:08,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:50:08,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:08,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506850383] [2023-11-29 03:50:08,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506850383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:08,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537049844] [2023-11-29 03:50:08,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:08,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:08,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:08,662 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:08,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:50:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:08,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 03:50:08,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:50:08,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:08,848 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 03:50:08,848 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 12 treesize of output 11 [2023-11-29 03:50:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:50:08,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537049844] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:50:08,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:50:08,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-11-29 03:50:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030175201] [2023-11-29 03:50:08,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:08,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:50:08,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:08,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:50:08,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:50:08,866 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:50:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:09,063 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2023-11-29 03:50:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:50:09,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-29 03:50:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:09,065 INFO L225 Difference]: With dead ends: 127 [2023-11-29 03:50:09,065 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 03:50:09,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:09,066 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 7 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:09,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 266 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:50:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 03:50:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2023-11-29 03:50:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 2.015625) internal successors, (129), 119 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:50:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2023-11-29 03:50:09,072 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 24 [2023-11-29 03:50:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:09,072 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2023-11-29 03:50:09,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:50:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2023-11-29 03:50:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:50:09,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:09,073 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:09,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:50:09,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 03:50:09,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:09,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1685960526, now seen corresponding path program 1 times [2023-11-29 03:50:09,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:09,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865828056] [2023-11-29 03:50:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:09,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:09,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:09,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:50:09,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:09,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865828056] [2023-11-29 03:50:09,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865828056] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:09,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100107923] [2023-11-29 03:50:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:09,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:09,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:09,511 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:09,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:50:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:09,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:50:09,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:50:09,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:09,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:09,880 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 19 treesize of output 23 [2023-11-29 03:50:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:50:10,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100107923] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:50:10,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:50:10,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-11-29 03:50:10,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680266391] [2023-11-29 03:50:10,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:10,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 03:50:10,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:10,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 03:50:10,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:50:10,040 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 03:50:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:10,442 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2023-11-29 03:50:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:50:10,447 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 24 [2023-11-29 03:50:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:10,448 INFO L225 Difference]: With dead ends: 129 [2023-11-29 03:50:10,449 INFO L226 Difference]: Without dead ends: 129 [2023-11-29 03:50:10,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:50:10,450 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 13 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:10,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 852 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:50:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-29 03:50:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2023-11-29 03:50:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 2.0) internal successors, (128), 119 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:50:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2023-11-29 03:50:10,455 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 24 [2023-11-29 03:50:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:10,456 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2023-11-29 03:50:10,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 03:50:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2023-11-29 03:50:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:50:10,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:10,457 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:10,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:50:10,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 03:50:10,660 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:10,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash -725168780, now seen corresponding path program 1 times [2023-11-29 03:50:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:10,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009932837] [2023-11-29 03:50:10,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:10,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:10,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:10,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:50:10,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:10,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009932837] [2023-11-29 03:50:10,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009932837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:10,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:10,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:10,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045417666] [2023-11-29 03:50:10,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:10,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:50:10,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:10,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:50:10,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:50:10,867 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:50:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:11,244 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2023-11-29 03:50:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:50:11,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-29 03:50:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:11,246 INFO L225 Difference]: With dead ends: 125 [2023-11-29 03:50:11,246 INFO L226 Difference]: Without dead ends: 125 [2023-11-29 03:50:11,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:50:11,247 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 9 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:11,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 422 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:50:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-29 03:50:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2023-11-29 03:50:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 64 states have (on average 1.984375) internal successors, (127), 118 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:50:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2023-11-29 03:50:11,253 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 25 [2023-11-29 03:50:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:11,253 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2023-11-29 03:50:11,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:50:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2023-11-29 03:50:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:50:11,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:11,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:11,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:50:11,255 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:11,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:11,256 INFO L85 PathProgramCache]: Analyzing trace with hash -725168779, now seen corresponding path program 1 times [2023-11-29 03:50:11,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:11,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280882713] [2023-11-29 03:50:11,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:11,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:11,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:50:11,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:11,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280882713] [2023-11-29 03:50:11,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280882713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:11,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:11,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:11,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112352962] [2023-11-29 03:50:11,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:11,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:50:11,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:11,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:50:11,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:50:11,609 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:50:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:11,955 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2023-11-29 03:50:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:50:11,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-29 03:50:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:11,957 INFO L225 Difference]: With dead ends: 123 [2023-11-29 03:50:11,957 INFO L226 Difference]: Without dead ends: 123 [2023-11-29 03:50:11,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:50:11,959 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:11,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 452 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:50:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-29 03:50:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-29 03:50:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 64 states have (on average 1.96875) internal successors, (126), 117 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:50:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2023-11-29 03:50:11,965 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 25 [2023-11-29 03:50:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:11,966 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2023-11-29 03:50:11,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:50:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2023-11-29 03:50:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 03:50:11,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:11,967 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:11,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 03:50:11,968 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:11,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1793219453, now seen corresponding path program 1 times [2023-11-29 03:50:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:11,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183891994] [2023-11-29 03:50:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:12,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:12,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:12,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:50:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:50:12,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:12,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183891994] [2023-11-29 03:50:12,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183891994] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:12,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153333691] [2023-11-29 03:50:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:12,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:12,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:12,616 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:12,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:50:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:12,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 03:50:12,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:12,880 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-29 03:50:12,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-29 03:50:12,964 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:50:12,964 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-29 03:50:13,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-29 03:50:13,042 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 03:50:13,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:50:13,082 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 18 treesize of output 13 [2023-11-29 03:50:13,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-29 03:50:13,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:50:13,216 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-29 03:50:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2023-11-29 03:50:13,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:13,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153333691] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:13,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:50:13,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2023-11-29 03:50:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769231230] [2023-11-29 03:50:13,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:13,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:50:13,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:13,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:50:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2023-11-29 03:50:13,298 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 17 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:50:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:13,932 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2023-11-29 03:50:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:50:13,933 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2023-11-29 03:50:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:13,934 INFO L225 Difference]: With dead ends: 132 [2023-11-29 03:50:13,935 INFO L226 Difference]: Without dead ends: 132 [2023-11-29 03:50:13,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=306, Unknown=1, NotChecked=36, Total=420 [2023-11-29 03:50:13,936 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 132 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:13,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 404 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 639 Invalid, 0 Unknown, 128 Unchecked, 0.5s Time] [2023-11-29 03:50:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-29 03:50:13,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2023-11-29 03:50:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 64 states have (on average 1.84375) internal successors, (118), 109 states have internal predecessors, (118), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:50:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2023-11-29 03:50:13,942 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 34 [2023-11-29 03:50:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:13,943 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2023-11-29 03:50:13,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:50:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2023-11-29 03:50:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 03:50:13,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:13,944 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:13,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 03:50:14,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 03:50:14,152 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:14,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:14,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1793219452, now seen corresponding path program 1 times [2023-11-29 03:50:14,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:14,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973401628] [2023-11-29 03:50:14,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:14,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:14,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:14,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:14,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:50:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 03:50:14,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:14,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973401628] [2023-11-29 03:50:14,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973401628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:14,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:14,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:14,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194225616] [2023-11-29 03:50:14,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:14,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:50:14,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:14,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:50:14,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:50:14,934 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 9 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:15,304 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2023-11-29 03:50:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:50:15,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2023-11-29 03:50:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:15,306 INFO L225 Difference]: With dead ends: 124 [2023-11-29 03:50:15,306 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 03:50:15,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:50:15,307 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 130 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:15,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 159 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:50:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 03:50:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2023-11-29 03:50:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.71875) internal successors, (110), 101 states have internal predecessors, (110), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:50:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2023-11-29 03:50:15,313 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 34 [2023-11-29 03:50:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:15,314 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2023-11-29 03:50:15,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2023-11-29 03:50:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 03:50:15,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:15,316 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:15,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 03:50:15,316 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:15,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1191339202, now seen corresponding path program 1 times [2023-11-29 03:50:15,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:15,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089994743] [2023-11-29 03:50:15,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:15,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:15,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:15,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:15,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 03:50:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 03:50:15,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:15,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089994743] [2023-11-29 03:50:15,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089994743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:15,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:15,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:50:15,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304014975] [2023-11-29 03:50:15,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:15,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:50:15,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:15,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:50:15,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:50:15,481 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:50:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:15,638 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2023-11-29 03:50:15,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:50:15,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-11-29 03:50:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:15,640 INFO L225 Difference]: With dead ends: 95 [2023-11-29 03:50:15,640 INFO L226 Difference]: Without dead ends: 95 [2023-11-29 03:50:15,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:50:15,641 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 2 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:15,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 284 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:50:15,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-29 03:50:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-29 03:50:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 90 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2023-11-29 03:50:15,646 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 34 [2023-11-29 03:50:15,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:15,646 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2023-11-29 03:50:15,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:50:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2023-11-29 03:50:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 03:50:15,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:15,648 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:15,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 03:50:15,648 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:15,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:15,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1002008060, now seen corresponding path program 1 times [2023-11-29 03:50:15,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:15,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496439642] [2023-11-29 03:50:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:15,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:15,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:50:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 03:50:15,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:15,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496439642] [2023-11-29 03:50:15,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496439642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:15,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:15,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:50:15,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443635853] [2023-11-29 03:50:15,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:15,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:15,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:15,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:15,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:15,847 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:50:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:16,092 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2023-11-29 03:50:16,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:50:16,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-11-29 03:50:16,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:16,093 INFO L225 Difference]: With dead ends: 91 [2023-11-29 03:50:16,093 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 03:50:16,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:50:16,094 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 24 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:16,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 267 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:50:16,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 03:50:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-29 03:50:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 86 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2023-11-29 03:50:16,099 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 36 [2023-11-29 03:50:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:16,099 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2023-11-29 03:50:16,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:50:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2023-11-29 03:50:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 03:50:16,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:16,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:16,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 03:50:16,101 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:16,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1002008059, now seen corresponding path program 1 times [2023-11-29 03:50:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:16,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639445089] [2023-11-29 03:50:16,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:16,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:16,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:16,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:50:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:50:16,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:16,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639445089] [2023-11-29 03:50:16,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639445089] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:16,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644036996] [2023-11-29 03:50:16,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:16,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:16,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:16,390 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:16,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:50:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:16,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 03:50:16,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 03:50:16,742 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:16,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644036996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:16,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:16,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-11-29 03:50:16,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818094740] [2023-11-29 03:50:16,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:16,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:50:16,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:16,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:50:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:50:16,744 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:50:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:16,900 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2023-11-29 03:50:16,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:50:16,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-11-29 03:50:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:16,902 INFO L225 Difference]: With dead ends: 87 [2023-11-29 03:50:16,902 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 03:50:16,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:50:16,903 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 19 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:16,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 276 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:50:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 03:50:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-29 03:50:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.543859649122807) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2023-11-29 03:50:16,906 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 36 [2023-11-29 03:50:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:16,906 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2023-11-29 03:50:16,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:50:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2023-11-29 03:50:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 03:50:16,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:16,907 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:16,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 03:50:17,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 03:50:17,108 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:17,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash -997467843, now seen corresponding path program 1 times [2023-11-29 03:50:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:17,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312001170] [2023-11-29 03:50:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:17,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:17,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:17,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:17,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:50:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:50:17,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:17,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312001170] [2023-11-29 03:50:17,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312001170] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:17,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887498884] [2023-11-29 03:50:17,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:17,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:17,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:17,661 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:17,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 03:50:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:17,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 03:50:17,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:17,984 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-29 03:50:18,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2023-11-29 03:50:18,121 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-29 03:50:18,174 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-29 03:50:18,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-11-29 03:50:18,196 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-29 03:50:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-11-29 03:50:18,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:18,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887498884] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:18,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:50:18,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 03:50:18,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822213579] [2023-11-29 03:50:18,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:18,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 03:50:18,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:18,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 03:50:18,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=295, Unknown=1, NotChecked=34, Total=380 [2023-11-29 03:50:18,265 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 19 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:50:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:18,799 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2023-11-29 03:50:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:50:18,800 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2023-11-29 03:50:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:18,801 INFO L225 Difference]: With dead ends: 87 [2023-11-29 03:50:18,801 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 03:50:18,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=472, Unknown=1, NotChecked=44, Total=600 [2023-11-29 03:50:18,803 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 89 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:18,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 577 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 649 Invalid, 0 Unknown, 89 Unchecked, 0.4s Time] [2023-11-29 03:50:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 03:50:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2023-11-29 03:50:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 81 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2023-11-29 03:50:18,807 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 37 [2023-11-29 03:50:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:18,807 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2023-11-29 03:50:18,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:50:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2023-11-29 03:50:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 03:50:18,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:18,808 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:18,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 03:50:19,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:19,009 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:19,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:19,010 INFO L85 PathProgramCache]: Analyzing trace with hash -997467842, now seen corresponding path program 1 times [2023-11-29 03:50:19,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:19,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601624031] [2023-11-29 03:50:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:19,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:19,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:19,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:19,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:50:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:50:19,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:19,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601624031] [2023-11-29 03:50:19,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601624031] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:19,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298545190] [2023-11-29 03:50:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:19,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:19,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:19,741 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:19,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 03:50:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:20,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 03:50:20,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:20,085 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-29 03:50:20,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-11-29 03:50:20,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2023-11-29 03:50:20,445 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_3| Int)) (<= 0 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_3|) 0) 4)))) is different from true [2023-11-29 03:50:20,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:50:20,512 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 24 treesize of output 19 [2023-11-29 03:50:20,525 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 03:50:20,526 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 15 treesize of output 15 [2023-11-29 03:50:20,627 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 23 treesize of output 15 [2023-11-29 03:50:20,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:50:20,636 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 37 treesize of output 29 [2023-11-29 03:50:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-11-29 03:50:20,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:20,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298545190] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:20,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:50:20,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2023-11-29 03:50:20,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877804958] [2023-11-29 03:50:20,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:20,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 03:50:20,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:20,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 03:50:20,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=540, Unknown=1, NotChecked=46, Total=650 [2023-11-29 03:50:20,850 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:50:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:21,995 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2023-11-29 03:50:21,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:50:21,996 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2023-11-29 03:50:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:21,997 INFO L225 Difference]: With dead ends: 92 [2023-11-29 03:50:21,997 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 03:50:21,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=1122, Unknown=1, NotChecked=68, Total=1332 [2023-11-29 03:50:21,999 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 102 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:21,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 834 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1031 Invalid, 0 Unknown, 93 Unchecked, 0.8s Time] [2023-11-29 03:50:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 03:50:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2023-11-29 03:50:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.467741935483871) internal successors, (91), 85 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2023-11-29 03:50:22,004 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 37 [2023-11-29 03:50:22,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:22,004 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2023-11-29 03:50:22,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:50:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2023-11-29 03:50:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 03:50:22,005 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:22,005 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:22,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-29 03:50:22,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:22,206 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:22,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:22,207 INFO L85 PathProgramCache]: Analyzing trace with hash -856726847, now seen corresponding path program 1 times [2023-11-29 03:50:22,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:22,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87219233] [2023-11-29 03:50:22,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:50:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:50:23,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:23,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87219233] [2023-11-29 03:50:23,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87219233] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:23,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824668808] [2023-11-29 03:50:23,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:23,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:23,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:23,588 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:23,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 03:50:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 03:50:23,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:23,890 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-29 03:50:24,069 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 39 treesize of output 1 [2023-11-29 03:50:24,113 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 19 treesize of output 5 [2023-11-29 03:50:24,117 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:50:24,117 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 15 treesize of output 7 [2023-11-29 03:50:24,247 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-11-29 03:50:24,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:50:24,258 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 28 treesize of output 23 [2023-11-29 03:50:24,313 INFO L349 Elim1Store]: treesize reduction 116, result has 32.2 percent of original size [2023-11-29 03:50:24,314 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 40 treesize of output 69 [2023-11-29 03:50:24,469 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 62 treesize of output 42 [2023-11-29 03:50:24,478 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 37 treesize of output 25 [2023-11-29 03:50:24,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 03:50:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-29 03:50:24,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:24,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824668808] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:24,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:50:24,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2023-11-29 03:50:24,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516835719] [2023-11-29 03:50:24,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:24,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 03:50:24,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:24,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 03:50:24,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1025, Unknown=1, NotChecked=64, Total=1190 [2023-11-29 03:50:24,791 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 32 states, 25 states have (on average 2.36) internal successors, (59), 28 states have internal predecessors, (59), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 03:50:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:26,026 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2023-11-29 03:50:26,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:50:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 2.36) internal successors, (59), 28 states have internal predecessors, (59), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2023-11-29 03:50:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:26,028 INFO L225 Difference]: With dead ends: 90 [2023-11-29 03:50:26,028 INFO L226 Difference]: Without dead ends: 90 [2023-11-29 03:50:26,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=213, Invalid=1952, Unknown=1, NotChecked=90, Total=2256 [2023-11-29 03:50:26,029 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 100 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:26,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 800 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 928 Invalid, 0 Unknown, 90 Unchecked, 0.8s Time] [2023-11-29 03:50:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-29 03:50:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-29 03:50:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 84 states have internal predecessors, (90), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-11-29 03:50:26,032 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 38 [2023-11-29 03:50:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:26,033 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-11-29 03:50:26,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 2.36) internal successors, (59), 28 states have internal predecessors, (59), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 03:50:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-11-29 03:50:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 03:50:26,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:26,034 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:26,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 03:50:26,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:26,234 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:26,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:26,235 INFO L85 PathProgramCache]: Analyzing trace with hash -856726846, now seen corresponding path program 1 times [2023-11-29 03:50:26,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:26,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587170015] [2023-11-29 03:50:26,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:26,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:27,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:50:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:50:28,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:28,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587170015] [2023-11-29 03:50:28,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587170015] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:28,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011696481] [2023-11-29 03:50:28,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:28,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:28,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:28,074 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:28,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 03:50:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-29 03:50:28,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:28,384 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-29 03:50:28,386 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-29 03:50:28,705 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:50:28,705 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-29 03:50:28,728 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:50:28,729 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-29 03:50:29,051 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 25 treesize of output 17 [2023-11-29 03:50:29,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2023-11-29 03:50:29,150 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 61 treesize of output 19 [2023-11-29 03:50:29,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2023-11-29 03:50:29,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:50:29,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 03:50:29,264 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 03:50:29,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:50:29,282 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 69 treesize of output 52 [2023-11-29 03:50:29,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:50:29,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-29 03:50:29,312 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-11-29 03:50:29,313 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 34 treesize of output 36 [2023-11-29 03:50:29,319 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 26 treesize of output 21 [2023-11-29 03:50:29,432 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 66 treesize of output 46 [2023-11-29 03:50:29,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2023-11-29 03:50:29,505 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 31 treesize of output 13 [2023-11-29 03:50:29,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:50:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 03:50:29,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:30,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011696481] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:30,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:50:30,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2023-11-29 03:50:30,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317352510] [2023-11-29 03:50:30,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:30,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 03:50:30,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:30,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 03:50:30,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1600, Unknown=1, NotChecked=80, Total=1806 [2023-11-29 03:50:30,008 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 39 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 32 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:50:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:31,796 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2023-11-29 03:50:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 03:50:31,797 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 32 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-11-29 03:50:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:31,798 INFO L225 Difference]: With dead ends: 89 [2023-11-29 03:50:31,798 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 03:50:31,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=254, Invalid=2719, Unknown=1, NotChecked=106, Total=3080 [2023-11-29 03:50:31,801 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 107 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:31,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 966 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1266 Invalid, 0 Unknown, 89 Unchecked, 1.1s Time] [2023-11-29 03:50:31,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 03:50:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-29 03:50:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.435483870967742) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:31,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-11-29 03:50:31,807 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 38 [2023-11-29 03:50:31,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:31,807 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-11-29 03:50:31,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 32 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:50:31,807 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-11-29 03:50:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 03:50:31,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:31,808 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:31,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 03:50:32,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 03:50:32,009 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:32,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:32,010 INFO L85 PathProgramCache]: Analyzing trace with hash 588932272, now seen corresponding path program 1 times [2023-11-29 03:50:32,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:32,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846005054] [2023-11-29 03:50:32,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:32,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:50:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 03:50:32,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:32,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846005054] [2023-11-29 03:50:32,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846005054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:32,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:32,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:50:32,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113972797] [2023-11-29 03:50:32,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:32,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:50:32,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:32,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:50:32,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:50:32,305 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 10 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:50:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:32,599 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2023-11-29 03:50:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:50:32,600 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-11-29 03:50:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:32,601 INFO L225 Difference]: With dead ends: 151 [2023-11-29 03:50:32,601 INFO L226 Difference]: Without dead ends: 151 [2023-11-29 03:50:32,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:50:32,602 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 137 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:32,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 279 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:50:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-29 03:50:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 91. [2023-11-29 03:50:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:50:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2023-11-29 03:50:32,608 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 41 [2023-11-29 03:50:32,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:32,608 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2023-11-29 03:50:32,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:50:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2023-11-29 03:50:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 03:50:32,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:32,609 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:32,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 03:50:32,610 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:50:32,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash 588932273, now seen corresponding path program 1 times [2023-11-29 03:50:32,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:32,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540542093] [2023-11-29 03:50:32,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:32,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:50:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:50:32,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:32,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540542093] [2023-11-29 03:50:32,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540542093] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:32,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463019166] [2023-11-29 03:50:32,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:32,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:32,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:32,954 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:32,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 03:50:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 03:50:33,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:33,443 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-29 03:50:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:50:33,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:33,491 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 8 treesize of output 4 [2023-11-29 03:50:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:50:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463019166] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:50:33,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:50:33,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-11-29 03:50:33,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941292048] [2023-11-29 03:50:33,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:33,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 03:50:33,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:33,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 03:50:33,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:50:33,525 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 03:50:37,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:50:41,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:50:45,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:50:49,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:50:53,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:50:57,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:51:01,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:51:05,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:51:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:05,816 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-11-29 03:51:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:51:05,816 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 41 [2023-11-29 03:51:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:05,817 INFO L225 Difference]: With dead ends: 85 [2023-11-29 03:51:05,817 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 03:51:05,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2023-11-29 03:51:05,818 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 161 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:05,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 548 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 8 Unknown, 0 Unchecked, 32.2s Time] [2023-11-29 03:51:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 03:51:05,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-29 03:51:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.423728813559322) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:51:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2023-11-29 03:51:05,821 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 41 [2023-11-29 03:51:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:05,821 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2023-11-29 03:51:05,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 03:51:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2023-11-29 03:51:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 03:51:05,821 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:05,822 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:05,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 03:51:06,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:06,022 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:51:06,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:06,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1996438783, now seen corresponding path program 1 times [2023-11-29 03:51:06,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:06,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623927324] [2023-11-29 03:51:06,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:06,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:51:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 03:51:06,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:06,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623927324] [2023-11-29 03:51:06,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623927324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:06,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:51:06,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:51:06,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51835693] [2023-11-29 03:51:06,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:06,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:51:06,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:06,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:51:06,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:51:06,133 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:51:06,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:06,249 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2023-11-29 03:51:06,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:51:06,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2023-11-29 03:51:06,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:06,251 INFO L225 Difference]: With dead ends: 84 [2023-11-29 03:51:06,251 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 03:51:06,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:06,252 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:06,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 249 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:51:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 03:51:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-29 03:51:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:51:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-11-29 03:51:06,255 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 43 [2023-11-29 03:51:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:06,255 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-11-29 03:51:06,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:51:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-11-29 03:51:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 03:51:06,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:06,256 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:06,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 03:51:06,256 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:51:06,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1996438784, now seen corresponding path program 1 times [2023-11-29 03:51:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:06,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253483910] [2023-11-29 03:51:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:51:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:51:06,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:06,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253483910] [2023-11-29 03:51:06,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253483910] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:06,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97871610] [2023-11-29 03:51:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:06,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:06,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:06,625 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:06,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 03:51:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:51:06,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:07,023 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 23 treesize of output 15 [2023-11-29 03:51:07,026 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 28 treesize of output 16 [2023-11-29 03:51:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 03:51:07,048 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:07,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97871610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:07,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:07,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2023-11-29 03:51:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034774532] [2023-11-29 03:51:07,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:07,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:51:07,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:07,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:51:07,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:51:07,050 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:51:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:07,165 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-11-29 03:51:07,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:51:07,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2023-11-29 03:51:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:07,167 INFO L225 Difference]: With dead ends: 83 [2023-11-29 03:51:07,167 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 03:51:07,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:51:07,168 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:07,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 225 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:51:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 03:51:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-29 03:51:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:51:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-11-29 03:51:07,171 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 43 [2023-11-29 03:51:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:07,172 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-11-29 03:51:07,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:51:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-11-29 03:51:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 03:51:07,173 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:07,173 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:07,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-29 03:51:07,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:07,377 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:51:07,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:07,378 INFO L85 PathProgramCache]: Analyzing trace with hash -795038422, now seen corresponding path program 1 times [2023-11-29 03:51:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:07,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394265434] [2023-11-29 03:51:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:07,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:51:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 03:51:07,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:07,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394265434] [2023-11-29 03:51:07,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394265434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:07,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:51:07,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:51:07,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832405031] [2023-11-29 03:51:07,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:07,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:51:07,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:07,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:51:07,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:51:07,601 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:51:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:07,746 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2023-11-29 03:51:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:51:07,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2023-11-29 03:51:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:07,747 INFO L225 Difference]: With dead ends: 102 [2023-11-29 03:51:07,747 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 03:51:07,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:51:07,748 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 82 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:07,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 254 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:51:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 03:51:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2023-11-29 03:51:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.4) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:51:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-11-29 03:51:07,752 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 46 [2023-11-29 03:51:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:07,753 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-11-29 03:51:07,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:51:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-11-29 03:51:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 03:51:07,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:07,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:07,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 03:51:07,754 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:51:07,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:07,755 INFO L85 PathProgramCache]: Analyzing trace with hash -795038421, now seen corresponding path program 1 times [2023-11-29 03:51:07,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:07,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555487828] [2023-11-29 03:51:07,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:07,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:51:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:51:08,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:08,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555487828] [2023-11-29 03:51:08,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555487828] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:08,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931197650] [2023-11-29 03:51:08,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:08,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:08,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:08,661 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:08,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 03:51:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 03:51:08,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:09,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-11-29 03:51:09,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2023-11-29 03:51:13,283 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 03:51:13,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 03:51:13,289 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 24 treesize of output 19 [2023-11-29 03:51:13,500 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 23 treesize of output 15 [2023-11-29 03:51:13,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:51:13,508 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 37 treesize of output 33 [2023-11-29 03:51:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:51:13,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:51:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931197650] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:13,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:51:13,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2023-11-29 03:51:13,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357346747] [2023-11-29 03:51:13,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:51:13,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 03:51:13,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:13,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 03:51:13,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=890, Unknown=1, NotChecked=0, Total=992 [2023-11-29 03:51:13,823 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 29 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 24 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 03:51:17,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:51:25,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:51:29,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:51:33,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:51:37,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:51:41,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:51:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:55,087 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2023-11-29 03:51:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 03:51:55,088 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 24 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2023-11-29 03:51:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:55,089 INFO L225 Difference]: With dead ends: 107 [2023-11-29 03:51:55,089 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 03:51:55,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=179, Invalid=1456, Unknown=5, NotChecked=0, Total=1640 [2023-11-29 03:51:55,091 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 165 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:55,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 640 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1081 Invalid, 6 Unknown, 0 Unchecked, 24.9s Time] [2023-11-29 03:51:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 03:51:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 86. [2023-11-29 03:51:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:51:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-11-29 03:51:55,095 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 46 [2023-11-29 03:51:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:55,095 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-11-29 03:51:55,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 24 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 03:51:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-11-29 03:51:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 03:51:55,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:55,096 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:55,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 03:51:55,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:55,297 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:51:55,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:55,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1427073799, now seen corresponding path program 1 times [2023-11-29 03:51:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:55,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66879343] [2023-11-29 03:51:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:57,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:51:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:51:58,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:58,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66879343] [2023-11-29 03:51:58,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66879343] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:58,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274868868] [2023-11-29 03:51:58,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:58,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:58,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:58,427 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:58,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 03:51:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:58,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 03:51:58,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:58,861 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-29 03:51:59,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:51:59,144 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:51:59,144 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-29 03:51:59,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:51:59,389 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-29 03:51:59,555 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-29 03:51:59,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-11-29 03:51:59,600 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 39 treesize of output 15 [2023-11-29 03:51:59,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2023-11-29 03:51:59,692 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-29 03:51:59,696 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 11 treesize of output 3 [2023-11-29 03:52:00,115 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:52:00,116 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 20 treesize of output 23 [2023-11-29 03:52:00,139 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 03:52:00,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 03:52:00,154 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 20 [2023-11-29 03:52:00,666 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:52:00,667 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:52:00,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 12 [2023-11-29 03:52:00,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 03:52:00,949 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-29 03:52:00,994 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-29 03:52:01,206 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 39 treesize of output 15 [2023-11-29 03:52:01,316 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 19 treesize of output 11 [2023-11-29 03:52:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:52:01,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:52:10,247 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4668 Int) (v_ArrVal_4664 (Array Int Int)) (v_ArrVal_4666 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4664) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4666)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_4668))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-11-29 03:52:10,260 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4668 Int) (v_ArrVal_4664 (Array Int Int)) (v_ArrVal_4666 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)) v_ArrVal_4664) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4666)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_4668))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-11-29 03:52:15,915 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4668 Int) (v_ArrVal_4664 (Array Int Int)) (v_ArrVal_4666 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_4664) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4666))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4668)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-11-29 03:52:16,010 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4668 Int) (v_ArrVal_4664 (Array Int Int)) (v_ArrVal_4666 (Array Int Int)) (v_ArrVal_4678 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_4678) .cse1) .cse2) v_ArrVal_4664) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_4666))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4668)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31|) 0)))) is different from false [2023-11-29 03:52:16,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274868868] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:52:16,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:52:16,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 54 [2023-11-29 03:52:16,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012005131] [2023-11-29 03:52:16,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:52:16,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-29 03:52:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:16,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-29 03:52:16,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=3263, Unknown=27, NotChecked=476, Total=4032 [2023-11-29 03:52:16,018 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 54 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 45 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:52:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:52:17,992 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2023-11-29 03:52:17,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 03:52:17,993 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 45 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2023-11-29 03:52:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:52:17,993 INFO L225 Difference]: With dead ends: 86 [2023-11-29 03:52:17,993 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 03:52:17,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=441, Invalid=5248, Unknown=27, NotChecked=604, Total=6320 [2023-11-29 03:52:17,997 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 133 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:52:17,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1071 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 03:52:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 03:52:17,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-29 03:52:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:52:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2023-11-29 03:52:18,000 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 50 [2023-11-29 03:52:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:52:18,001 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2023-11-29 03:52:18,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 45 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:52:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2023-11-29 03:52:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 03:52:18,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:52:18,002 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:52:18,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 03:52:18,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:18,202 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:52:18,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:52:18,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1426978206, now seen corresponding path program 1 times [2023-11-29 03:52:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:52:18,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852217927] [2023-11-29 03:52:18,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:18,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:52:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:52:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:52:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:52:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 03:52:18,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:52:18,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852217927] [2023-11-29 03:52:18,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852217927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:52:18,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:52:18,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:52:18,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894130184] [2023-11-29 03:52:18,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:52:18,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:52:18,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:18,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:52:18,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:52:18,340 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:52:18,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:52:18,508 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2023-11-29 03:52:18,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:52:18,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2023-11-29 03:52:18,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:52:18,509 INFO L225 Difference]: With dead ends: 102 [2023-11-29 03:52:18,509 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 03:52:18,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:52:18,510 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 45 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:52:18,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 203 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:52:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 03:52:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2023-11-29 03:52:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:52:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2023-11-29 03:52:18,513 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 50 [2023-11-29 03:52:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:52:18,513 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2023-11-29 03:52:18,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:52:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2023-11-29 03:52:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 03:52:18,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:52:18,514 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:52:18,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 03:52:18,514 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:52:18,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:52:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1426978205, now seen corresponding path program 1 times [2023-11-29 03:52:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:52:18,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658446266] [2023-11-29 03:52:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:18,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:52:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:52:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:52:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:52:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:52:18,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:52:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658446266] [2023-11-29 03:52:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658446266] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:52:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335306710] [2023-11-29 03:52:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:18,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:18,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:52:18,834 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:52:18,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 03:52:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:19,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 03:52:19,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:52:19,520 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-29 03:52:19,522 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 24 treesize of output 12 [2023-11-29 03:52:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:52:19,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:52:19,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:52:19,679 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 31 treesize of output 35 [2023-11-29 03:52:19,858 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 26 treesize of output 14 [2023-11-29 03:52:19,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 03:52:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:52:20,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335306710] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:52:20,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:52:20,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 33 [2023-11-29 03:52:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459062841] [2023-11-29 03:52:20,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:52:20,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 03:52:20,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:20,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 03:52:20,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 03:52:20,021 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 34 states, 30 states have (on average 3.566666666666667) internal successors, (107), 30 states have internal predecessors, (107), 4 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 03:52:20,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:52:20,805 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2023-11-29 03:52:20,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 03:52:20,806 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 3.566666666666667) internal successors, (107), 30 states have internal predecessors, (107), 4 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2023-11-29 03:52:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:52:20,807 INFO L225 Difference]: With dead ends: 84 [2023-11-29 03:52:20,807 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 03:52:20,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=1379, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 03:52:20,808 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 180 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:52:20,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 677 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:52:20,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 03:52:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-29 03:52:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:52:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-11-29 03:52:20,813 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 50 [2023-11-29 03:52:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:52:20,813 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-11-29 03:52:20,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 3.566666666666667) internal successors, (107), 30 states have internal predecessors, (107), 4 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 03:52:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-11-29 03:52:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 03:52:20,814 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:52:20,814 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:52:20,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 03:52:21,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:21,015 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:52:21,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:52:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1231485752, now seen corresponding path program 1 times [2023-11-29 03:52:21,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:52:21,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660503336] [2023-11-29 03:52:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:21,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:52:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:23,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:52:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:23,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:52:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:23,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:52:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:52:23,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:52:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660503336] [2023-11-29 03:52:23,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660503336] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:52:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206238521] [2023-11-29 03:52:23,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:23,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:23,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:52:23,931 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:52:23,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 03:52:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:24,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 03:52:24,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:52:25,319 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 27 treesize of output 1 [2023-11-29 03:52:25,673 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 32 treesize of output 20 [2023-11-29 03:52:25,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:52:25,780 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 24 treesize of output 20 [2023-11-29 03:52:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:52:25,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:52:26,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:52:26,384 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 198 treesize of output 160 [2023-11-29 03:52:26,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:52:26,916 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 42 treesize of output 60 [2023-11-29 03:52:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 03:52:27,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206238521] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 03:52:27,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:52:27,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [29, 17] total 52 [2023-11-29 03:52:27,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004295027] [2023-11-29 03:52:27,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:52:27,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:52:27,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:27,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:52:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2579, Unknown=0, NotChecked=0, Total=2756 [2023-11-29 03:52:27,127 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:52:31,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:52:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:52:32,285 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2023-11-29 03:52:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:52:32,285 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2023-11-29 03:52:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:52:32,286 INFO L225 Difference]: With dead ends: 100 [2023-11-29 03:52:32,287 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 03:52:32,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=223, Invalid=3199, Unknown=0, NotChecked=0, Total=3422 [2023-11-29 03:52:32,289 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 121 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:52:32,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 292 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2023-11-29 03:52:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 03:52:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 83. [2023-11-29 03:52:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:52:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-11-29 03:52:32,292 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 52 [2023-11-29 03:52:32,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:52:32,292 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-11-29 03:52:32,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:52:32,292 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-11-29 03:52:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 03:52:32,293 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:52:32,293 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:52:32,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 03:52:32,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:32,494 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:52:32,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:52:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1231485751, now seen corresponding path program 1 times [2023-11-29 03:52:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:52:32,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831338673] [2023-11-29 03:52:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:52:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:36,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:52:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:52:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:36,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:52:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:52:37,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:52:37,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831338673] [2023-11-29 03:52:37,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831338673] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:52:37,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381491969] [2023-11-29 03:52:37,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:37,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:37,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:52:37,384 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:52:37,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 03:52:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:37,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 139 conjunts are in the unsatisfiable core [2023-11-29 03:52:37,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:52:37,876 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-29 03:52:38,488 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:52:38,488 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-29 03:52:38,507 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-29 03:52:38,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:52:38,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:52:38,945 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-29 03:52:38,955 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-29 03:52:39,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:52:39,324 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-29 03:52:39,465 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 31 treesize of output 26 [2023-11-29 03:52:39,479 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 70 treesize of output 41 [2023-11-29 03:52:39,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 22 [2023-11-29 03:52:39,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 03:52:39,668 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 23 treesize of output 7 [2023-11-29 03:52:39,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:52:40,334 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:52:40,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2023-11-29 03:52:40,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:52:40,367 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 70 treesize of output 41 [2023-11-29 03:52:40,396 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 03:52:40,396 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 28 treesize of output 30 [2023-11-29 03:52:40,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-29 03:52:41,513 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:52:41,528 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2023-11-29 03:52:41,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 90 [2023-11-29 03:52:41,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:52:41,550 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 59 treesize of output 20 [2023-11-29 03:52:41,748 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 31 treesize of output 20 [2023-11-29 03:52:41,773 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 69 treesize of output 40 [2023-11-29 03:52:41,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 31 treesize of output 20 [2023-11-29 03:52:41,884 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 69 treesize of output 40 [2023-11-29 03:52:42,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 18 [2023-11-29 03:52:42,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 40 [2023-11-29 03:52:42,410 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 84 treesize of output 48 [2023-11-29 03:52:42,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-11-29 03:52:42,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:52:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:52:42,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:52:43,643 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_5714 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5714))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse3) .cse4) 8))) (forall ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_5714 (Array Int Int)) (v_ArrVal_5713 (Array Int Int))) (<= (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5714))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse3) .cse4) 12) (select |c_#length| (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5713))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse3) .cse4)))))) is different from false [2023-11-29 03:52:43,706 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_5710 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_5714 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5710) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5714))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse3) .cse4) 8))) (forall ((v_ArrVal_5709 (Array Int Int)) (v_ArrVal_5710 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_5714 (Array Int Int)) (v_ArrVal_5713 (Array Int Int))) (<= (+ (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5710) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5714))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse3) .cse4) 12) (select |c_#length| (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5709) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5713))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse3) .cse4)))))) is different from false [2023-11-29 03:52:44,402 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_5710 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_5714 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_5710) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5714))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse4) .cse5) 8))) (forall ((v_ArrVal_5709 (Array Int Int)) (v_ArrVal_5710 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_5714 (Array Int Int)) (v_ArrVal_5713 (Array Int Int))) (<= (+ (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_5710) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5714))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse4) .cse5) 12) (select |c_#length| (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_5709) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5713))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse4) .cse5))))))) is different from false [2023-11-29 03:52:44,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_5710 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_5714 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_5710) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5714))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse4) .cse5) 8))) (forall ((v_ArrVal_5709 (Array Int Int)) (v_ArrVal_5710 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_5714 (Array Int Int)) (v_ArrVal_5713 (Array Int Int))) (<= (+ (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_5710) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5714))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse4) .cse5) 12) (select |c_#length| (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_5709) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5713))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) .cse4) .cse5))))))) is different from false [2023-11-29 03:52:44,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381491969] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:52:44,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:52:44,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 55 [2023-11-29 03:52:44,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577757595] [2023-11-29 03:52:44,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:52:44,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-29 03:52:44,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:44,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-29 03:52:44,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3616, Unknown=56, NotChecked=500, Total=4422 [2023-11-29 03:52:44,941 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 56 states, 47 states have (on average 1.872340425531915) internal successors, (88), 47 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:52:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:52:50,252 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2023-11-29 03:52:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 03:52:50,253 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 47 states have (on average 1.872340425531915) internal successors, (88), 47 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2023-11-29 03:52:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:52:50,254 INFO L225 Difference]: With dead ends: 121 [2023-11-29 03:52:50,254 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 03:52:50,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=467, Invalid=5811, Unknown=58, NotChecked=636, Total=6972 [2023-11-29 03:52:50,258 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 156 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:52:50,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1055 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 03:52:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 03:52:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 90. [2023-11-29 03:52:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:52:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2023-11-29 03:52:50,263 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 52 [2023-11-29 03:52:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:52:50,263 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2023-11-29 03:52:50,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 47 states have (on average 1.872340425531915) internal successors, (88), 47 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:52:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2023-11-29 03:52:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 03:52:50,264 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:52:50,264 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:52:50,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 03:52:50,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:50,465 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:52:50,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:52:50,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1231485717, now seen corresponding path program 1 times [2023-11-29 03:52:50,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:52:50,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987295585] [2023-11-29 03:52:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:52:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:52,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:52:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:52,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:52:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:53,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:52:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:52:53,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:52:53,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987295585] [2023-11-29 03:52:53,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987295585] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:52:53,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445494717] [2023-11-29 03:52:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:53,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:53,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:52:53,415 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:52:53,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 03:52:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:53,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 105 conjunts are in the unsatisfiable core [2023-11-29 03:52:53,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:52:53,906 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-29 03:52:54,303 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:52:54,303 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-29 03:52:54,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:52:54,651 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:52:54,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 03:52:54,879 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:52:54,879 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 33 treesize of output 24 [2023-11-29 03:52:54,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 36 [2023-11-29 03:52:55,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2023-11-29 03:52:55,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:52:55,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:52:55,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 57 treesize of output 34 [2023-11-29 03:52:55,556 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 03:52:55,556 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 28 treesize of output 30 [2023-11-29 03:52:56,340 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:52:56,354 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2023-11-29 03:52:56,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 72 [2023-11-29 03:52:56,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:52:56,560 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 75 treesize of output 46 [2023-11-29 03:52:56,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:52:56,836 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 75 treesize of output 46 [2023-11-29 03:52:57,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 40 [2023-11-29 03:52:57,267 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 86 treesize of output 50 [2023-11-29 03:52:57,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:52:57,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 26 [2023-11-29 03:52:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:52:57,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:52:58,185 INFO L349 Elim1Store]: treesize reduction 18, result has 84.6 percent of original size [2023-11-29 03:52:58,185 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 64 treesize of output 110 [2023-11-29 03:52:58,200 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6022 (Array Int Int)) (v_ArrVal_6020 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6020) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6022)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0) (= .cse0 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)))) is different from false [2023-11-29 03:52:58,219 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6022 (Array Int Int)) (v_ArrVal_6020 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse0 (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6020) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6022)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= .cse0 .cse1) (= .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))))) is different from false [2023-11-29 03:52:58,531 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6022 (Array Int Int)) (v_ArrVal_6020 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4))) (let ((.cse1 (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6020) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6022))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= .cse0 .cse1) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)))))) is different from false [2023-11-29 03:52:58,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445494717] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:52:58,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:52:58,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 55 [2023-11-29 03:52:58,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382384595] [2023-11-29 03:52:58,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:52:58,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-29 03:52:58,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:58,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-29 03:52:58,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=3500, Unknown=47, NotChecked=366, Total=4160 [2023-11-29 03:52:58,844 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 56 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 47 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:53:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:02,948 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2023-11-29 03:53:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 03:53:02,948 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 47 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2023-11-29 03:53:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:02,950 INFO L225 Difference]: With dead ends: 107 [2023-11-29 03:53:02,950 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 03:53:02,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=454, Invalid=5516, Unknown=48, NotChecked=462, Total=6480 [2023-11-29 03:53:02,953 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 217 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:02,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1101 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 03:53:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 03:53:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2023-11-29 03:53:02,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.318840579710145) internal successors, (91), 84 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:53:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-11-29 03:53:02,960 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 52 [2023-11-29 03:53:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:02,960 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-11-29 03:53:02,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 47 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:53:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-11-29 03:53:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 03:53:02,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:02,961 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:02,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-29 03:53:03,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-29 03:53:03,162 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:53:03,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:03,163 INFO L85 PathProgramCache]: Analyzing trace with hash 94909340, now seen corresponding path program 1 times [2023-11-29 03:53:03,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:03,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245422212] [2023-11-29 03:53:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:03,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:05,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:05,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:05,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:53:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:53:06,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:06,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245422212] [2023-11-29 03:53:06,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245422212] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:06,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887452738] [2023-11-29 03:53:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:06,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:06,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:06,164 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:06,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 03:53:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:06,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-29 03:53:06,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:06,661 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-29 03:53:06,944 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:53:06,945 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-29 03:53:07,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:53:07,240 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:53:07,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2023-11-29 03:53:07,458 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:53:07,458 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 24 treesize of output 17 [2023-11-29 03:53:07,577 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 57 treesize of output 36 [2023-11-29 03:53:07,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2023-11-29 03:53:07,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:53:08,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:08,231 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 57 treesize of output 34 [2023-11-29 03:53:08,252 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 03:53:08,253 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 28 treesize of output 30 [2023-11-29 03:53:09,041 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:09,055 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2023-11-29 03:53:09,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 59 [2023-11-29 03:53:09,215 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 56 treesize of output 33 [2023-11-29 03:53:09,290 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 56 treesize of output 33 [2023-11-29 03:53:09,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 35 [2023-11-29 03:53:10,123 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 71 treesize of output 39 [2023-11-29 03:53:10,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:53:10,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2023-11-29 03:53:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:53:10,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:53:11,098 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6320 (Array Int Int)) (v_ArrVal_6318 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6318) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6320)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))) is different from false [2023-11-29 03:53:11,111 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6320 (Array Int Int)) (v_ArrVal_6318 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)) v_ArrVal_6318) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6320)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))) is different from false [2023-11-29 03:53:11,124 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6320 (Array Int Int)) (v_ArrVal_6318 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) v_ArrVal_6318) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6320))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))) is different from false [2023-11-29 03:53:11,148 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6320 (Array Int Int)) (v_ArrVal_6318 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) v_ArrVal_6318) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6320))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))) is different from false [2023-11-29 03:53:11,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887452738] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:11,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:53:11,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 57 [2023-11-29 03:53:11,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136705539] [2023-11-29 03:53:11,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:53:11,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-29 03:53:11,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:11,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-29 03:53:11,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3921, Unknown=13, NotChecked=516, Total=4692 [2023-11-29 03:53:11,421 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 57 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 48 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:53:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:14,764 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2023-11-29 03:53:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 03:53:14,765 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 48 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 56 [2023-11-29 03:53:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:14,765 INFO L225 Difference]: With dead ends: 93 [2023-11-29 03:53:14,766 INFO L226 Difference]: Without dead ends: 93 [2023-11-29 03:53:14,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=381, Invalid=5784, Unknown=13, NotChecked=628, Total=6806 [2023-11-29 03:53:14,767 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 62 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:14,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1427 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 03:53:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-29 03:53:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2023-11-29 03:53:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:53:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-11-29 03:53:14,770 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 56 [2023-11-29 03:53:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:14,770 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-11-29 03:53:14,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 48 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:53:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-11-29 03:53:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 03:53:14,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:14,771 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:14,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-29 03:53:14,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-29 03:53:14,972 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:53:14,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:14,973 INFO L85 PathProgramCache]: Analyzing trace with hash 126428218, now seen corresponding path program 1 times [2023-11-29 03:53:14,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:14,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083115339] [2023-11-29 03:53:14,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:14,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:19,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:53:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:53:20,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:20,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083115339] [2023-11-29 03:53:20,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083115339] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:20,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262276557] [2023-11-29 03:53:20,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:20,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:20,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:20,093 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:20,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-29 03:53:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:20,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 175 conjunts are in the unsatisfiable core [2023-11-29 03:53:20,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:20,666 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-29 03:53:20,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:53:21,321 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:53:21,321 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 16 treesize of output 15 [2023-11-29 03:53:21,350 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:53:21,350 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-29 03:53:21,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:53:21,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:53:21,668 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-29 03:53:21,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:53:21,874 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-29 03:53:21,883 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-29 03:53:22,274 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-29 03:53:22,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:53:22,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:53:22,349 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 31 treesize of output 26 [2023-11-29 03:53:22,360 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 72 treesize of output 43 [2023-11-29 03:53:22,372 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 32 treesize of output 19 [2023-11-29 03:53:22,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 24 [2023-11-29 03:53:22,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:53:22,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:53:22,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:53:22,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2023-11-29 03:53:23,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:23,250 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 72 treesize of output 43 [2023-11-29 03:53:23,272 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 03:53:23,273 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 28 treesize of output 30 [2023-11-29 03:53:23,286 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 19 [2023-11-29 03:53:23,306 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 31 treesize of output 20 [2023-11-29 03:53:24,516 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:24,533 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2023-11-29 03:53:24,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 220 treesize of output 159 [2023-11-29 03:53:24,543 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:24,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:24,546 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 93 [2023-11-29 03:53:24,562 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:24,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:24,564 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 101 treesize of output 19 [2023-11-29 03:53:24,754 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 31 treesize of output 20 [2023-11-29 03:53:24,770 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 71 treesize of output 42 [2023-11-29 03:53:24,780 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 19 [2023-11-29 03:53:24,884 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 71 treesize of output 42 [2023-11-29 03:53:24,899 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 19 [2023-11-29 03:53:24,914 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 31 treesize of output 20 [2023-11-29 03:53:25,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 18 [2023-11-29 03:53:25,211 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 32 treesize of output 19 [2023-11-29 03:53:25,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 42 [2023-11-29 03:53:25,440 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 86 treesize of output 50 [2023-11-29 03:53:25,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-11-29 03:53:25,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:53:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:53:26,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:53:29,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262276557] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:29,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:53:29,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 61 [2023-11-29 03:53:29,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691346371] [2023-11-29 03:53:29,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:53:29,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-29 03:53:29,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:29,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-29 03:53:29,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=4663, Unknown=28, NotChecked=0, Total=4970 [2023-11-29 03:53:29,038 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 61 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 51 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:53:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:34,116 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2023-11-29 03:53:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 03:53:34,117 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 51 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 56 [2023-11-29 03:53:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:34,118 INFO L225 Difference]: With dead ends: 89 [2023-11-29 03:53:34,118 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 03:53:34,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=528, Invalid=8000, Unknown=28, NotChecked=0, Total=8556 [2023-11-29 03:53:34,119 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 87 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:34,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1053 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 03:53:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 03:53:34,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-29 03:53:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:53:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2023-11-29 03:53:34,122 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 56 [2023-11-29 03:53:34,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:34,123 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2023-11-29 03:53:34,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 51 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:53:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2023-11-29 03:53:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 03:53:34,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:34,124 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:34,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-11-29 03:53:34,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-11-29 03:53:34,324 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:53:34,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1330300874, now seen corresponding path program 1 times [2023-11-29 03:53:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:34,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118751051] [2023-11-29 03:53:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:34,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:53:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:53:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:43,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118751051] [2023-11-29 03:53:43,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118751051] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:43,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688185485] [2023-11-29 03:53:43,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:43,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:43,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:43,499 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:43,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-29 03:53:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:43,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 153 conjunts are in the unsatisfiable core [2023-11-29 03:53:43,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:44,055 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-29 03:53:44,579 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:53:44,579 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-29 03:53:44,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:53:44,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:53:45,054 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:53:45,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2023-11-29 03:53:45,064 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 11 [2023-11-29 03:53:45,414 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:53:45,414 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 16 treesize of output 15 [2023-11-29 03:53:45,459 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:53:45,459 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 33 treesize of output 24 [2023-11-29 03:53:45,590 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 31 treesize of output 26 [2023-11-29 03:53:45,603 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 57 treesize of output 36 [2023-11-29 03:53:45,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2023-11-29 03:53:45,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:53:45,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:53:45,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2023-11-29 03:53:46,476 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:53:46,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2023-11-29 03:53:46,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:46,508 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 57 treesize of output 34 [2023-11-29 03:53:46,538 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 03:53:46,538 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 28 treesize of output 30 [2023-11-29 03:53:47,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:47,725 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:47,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:47,740 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:47,755 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-29 03:53:47,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 93 [2023-11-29 03:53:47,776 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:47,777 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:47,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:47,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2023-11-29 03:53:48,144 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:48,157 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 03:53:48,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 65 [2023-11-29 03:53:48,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:48,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:48,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2023-11-29 03:53:48,816 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:48,832 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 03:53:48,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 65 [2023-11-29 03:53:48,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:48,842 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:53:48,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:48,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 70 [2023-11-29 03:53:49,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:53:49,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2023-11-29 03:53:49,464 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:53:49,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 146 treesize of output 67 [2023-11-29 03:53:49,776 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 148 treesize of output 100 [2023-11-29 03:53:50,539 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:53:50,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 41 [2023-11-29 03:53:50,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-29 03:53:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:53:50,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:53:51,658 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem13#1.offset|)))) (store .cse10 .cse2 (store (select .cse10 .cse2) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse0 .cse4) .cse5))) (and (forall ((v_ArrVal_6967 (Array Int Int))) (<= 0 (+ 8 (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6967))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse4) .cse5)) .cse6)))) (forall ((v_ArrVal_6967 (Array Int Int))) (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6967))) (store .cse9 .cse2 (store (select .cse9 .cse2) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))))) (let ((.cse7 (select (select .cse8 .cse4) .cse5))) (<= (+ 12 (select (select .cse0 .cse7) .cse6)) (select |c_#length| (select (select .cse8 .cse7) .cse6)))))))))) is different from false [2023-11-29 03:53:52,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:53:52,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 128 [2023-11-29 03:53:52,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:53:52,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 242 [2023-11-29 03:53:52,442 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (+ .cse10 4))) (and (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_6967 (Array Int Int))) (or (let ((.cse0 (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_arrayElimArr_2))) (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (.cse3 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6967))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))))) (let ((.cse1 (select (select .cse3 .cse4) .cse5)) (.cse2 (select (select .cse0 .cse4) .cse5))) (< (+ 11 (select (select .cse0 .cse1) .cse2)) (select |c_#length| (select (select .cse3 .cse1) .cse2))))) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse10)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_6967 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse10)) (< 0 (+ (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_arrayElimArr_1))) (store .cse13 .cse7 (store (select .cse13 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))) (select (select .cse11 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6967))) (store .cse12 .cse7 (store (select .cse12 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse4) .cse5)) (select (select .cse11 .cse4) .cse5))) 9))))))) is different from false [2023-11-29 03:53:52,489 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ .cse0 4)) (.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_6967 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse0)) (< 0 (+ (let ((.cse1 (let ((.cse8 (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_arrayElimArr_1))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))) (select (select .cse1 (select (select (let ((.cse2 (store .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6967))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse6) .cse7)) (select (select .cse1 .cse6) .cse7))) 9)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_6967 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse0)) (let ((.cse10 (let ((.cse15 (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_arrayElimArr_2))) (store .cse15 .cse3 (store (select .cse15 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (.cse13 (let ((.cse14 (store .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6967))) (store .cse14 .cse3 (store (select .cse14 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))))) (let ((.cse11 (select (select .cse13 .cse6) .cse7)) (.cse12 (select (select .cse10 .cse6) .cse7))) (< (+ (select (select .cse10 .cse11) .cse12) 11) (select |c_#length| (select (select .cse13 .cse11) .cse12)))))))))) is different from false [2023-11-29 03:53:52,537 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse16 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) .cse18)) (.cse17 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) .cse18))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#1.base| .cse16 (store (select |c_#memory_$Pointer$#1.base| .cse16) .cse17 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ .cse0 4)) (.cse9 (store |c_#memory_$Pointer$#1.offset| .cse16 (store (select |c_#memory_$Pointer$#1.offset| .cse16) .cse17 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_6967 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse0)) (< 0 (+ (let ((.cse1 (let ((.cse8 (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_arrayElimArr_1))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))) (select (select .cse1 (select (select (let ((.cse2 (store .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6967))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse6) .cse7)) (select (select .cse1 .cse6) .cse7))) 9)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_6967 (Array Int Int))) (or (let ((.cse10 (let ((.cse15 (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_arrayElimArr_2))) (store .cse15 .cse3 (store (select .cse15 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (.cse13 (let ((.cse14 (store .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6967))) (store .cse14 .cse3 (store (select .cse14 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))))) (let ((.cse11 (select (select .cse13 .cse6) .cse7)) (.cse12 (select (select .cse10 .cse6) .cse7))) (< (+ (select (select .cse10 .cse11) .cse12) 11) (select |c_#length| (select (select .cse13 .cse11) .cse12))))) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse0)))))))) is different from false [2023-11-29 03:53:52,583 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (+ .cse12 4))) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| .cse7) .cse8)) (.cse17 (select (select |c_#memory_$Pointer$#1.offset| .cse7) .cse8))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse16 (store (select |c_#memory_$Pointer$#1.base| .cse16) .cse17 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (store |c_#memory_$Pointer$#1.offset| .cse16 (store (select |c_#memory_$Pointer$#1.offset| .cse16) .cse17 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (and (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_6967 (Array Int Int))) (or (let ((.cse0 (let ((.cse10 (store .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_arrayElimArr_2))) (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (.cse3 (let ((.cse6 (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6967))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))))) (let ((.cse1 (select (select .cse3 .cse4) .cse5)) (.cse2 (select (select .cse0 .cse4) .cse5))) (< (+ (select (select .cse0 .cse1) .cse2) 11) (select |c_#length| (select (select .cse3 .cse1) .cse2))))) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse12)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_6967 (Array Int Int))) (or (< 0 (+ 9 (let ((.cse13 (let ((.cse15 (store .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_arrayElimArr_1))) (store .cse15 .cse7 (store (select .cse15 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))) (select (select .cse13 (select (select (let ((.cse14 (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6967))) (store .cse14 .cse7 (store (select .cse14 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse4) .cse5)) (select (select .cse13 .cse4) .cse5))))) (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse12))))))))) is different from false [2023-11-29 03:53:56,733 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (+ .cse12 4))) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| .cse7) .cse8)) (.cse17 (select (select |c_#memory_$Pointer$#1.offset| .cse7) .cse8))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse16 (store (select |c_#memory_$Pointer$#1.base| .cse16) .cse17 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (store |c_#memory_$Pointer$#1.offset| .cse16 (store (select |c_#memory_$Pointer$#1.offset| .cse16) .cse17 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))) (and (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_6967 (Array Int Int))) (or (let ((.cse0 (let ((.cse10 (store .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_arrayElimArr_2))) (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))) (.cse3 (let ((.cse6 (store .cse9 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6967))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))))) (let ((.cse1 (select (select .cse3 .cse4) .cse5)) (.cse2 (select (select .cse0 .cse4) .cse5))) (< (+ (select (select .cse0 .cse1) .cse2) 11) (select |c_#length| (select (select .cse3 .cse1) .cse2))))) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) .cse12)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_6967 (Array Int Int))) (or (< 0 (+ (let ((.cse13 (let ((.cse15 (store .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_arrayElimArr_1))) (store .cse15 .cse7 (store (select .cse15 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))))) (select (select .cse13 (select (select (let ((.cse14 (store .cse9 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6967))) (store .cse14 .cse7 (store (select .cse14 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) .cse4) .cse5)) (select (select .cse13 .cse4) .cse5))) 9)) (not (= .cse12 (select v_arrayElimArr_1 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))))))))) is different from false [2023-11-29 03:53:56,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:53:56,932 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 1493 treesize of output 1497 [2023-11-29 03:54:03,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688185485] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:54:03,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:54:03,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 61 [2023-11-29 03:54:03,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044781691] [2023-11-29 03:54:03,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:54:03,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-29 03:54:03,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:54:03,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-29 03:54:03,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=4578, Unknown=20, NotChecked=846, Total=5700 [2023-11-29 03:54:03,189 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 62 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 states have internal predecessors, (98), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:54:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:54:16,263 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2023-11-29 03:54:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 03:54:16,264 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 states have internal predecessors, (98), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2023-11-29 03:54:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:54:16,265 INFO L225 Difference]: With dead ends: 127 [2023-11-29 03:54:16,265 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 03:54:16,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=595, Invalid=8721, Unknown=20, NotChecked=1170, Total=10506 [2023-11-29 03:54:16,266 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 356 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:54:16,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1212 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 03:54:16,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 03:54:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2023-11-29 03:54:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:54:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2023-11-29 03:54:16,271 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 58 [2023-11-29 03:54:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:54:16,271 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2023-11-29 03:54:16,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 states have internal predecessors, (98), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:54:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2023-11-29 03:54:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 03:54:16,272 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:54:16,272 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:54:16,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-11-29 03:54:16,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-11-29 03:54:16,473 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:54:16,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1330300908, now seen corresponding path program 2 times [2023-11-29 03:54:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:16,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966771709] [2023-11-29 03:54:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:16,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:54:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:21,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:54:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:54:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:54:22,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:54:22,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966771709] [2023-11-29 03:54:22,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966771709] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:54:22,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351341540] [2023-11-29 03:54:22,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:54:22,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:54:22,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:54:22,543 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:54:22,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-29 03:54:23,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:54:23,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:54:23,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 160 conjunts are in the unsatisfiable core [2023-11-29 03:54:23,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:54:23,251 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-29 03:54:23,622 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:54:23,623 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-29 03:54:23,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:54:23,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:54:24,021 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:54:24,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2023-11-29 03:54:24,030 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 11 [2023-11-29 03:54:24,333 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:54:24,333 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 16 treesize of output 15 [2023-11-29 03:54:24,356 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:54:24,356 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 24 treesize of output 17 [2023-11-29 03:54:24,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2023-11-29 03:54:24,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 31 treesize of output 26 [2023-11-29 03:54:24,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-11-29 03:54:24,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2023-11-29 03:54:24,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2023-11-29 03:54:25,321 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-29 03:54:25,322 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 29 [2023-11-29 03:54:25,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-11-29 03:54:25,357 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 31 treesize of output 20 [2023-11-29 03:54:26,508 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:54:26,508 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:54:26,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:54:26,511 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:54:26,525 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-29 03:54:26,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 72 [2023-11-29 03:54:26,541 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:54:26,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 49 [2023-11-29 03:54:26,818 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:54:26,835 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2023-11-29 03:54:26,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62 [2023-11-29 03:54:26,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:54:26,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2023-11-29 03:54:26,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2023-11-29 03:54:27,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:54:27,273 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2023-11-29 03:54:27,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 74 [2023-11-29 03:54:27,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:54:27,284 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 68 treesize of output 51 [2023-11-29 03:54:27,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2023-11-29 03:54:27,611 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:54:27,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 48 [2023-11-29 03:54:28,473 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 74 [2023-11-29 03:54:28,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:54:29,432 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:54:29,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 27 [2023-11-29 03:54:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:54:29,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:54:34,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351341540] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:54:34,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:54:34,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 64 [2023-11-29 03:54:34,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553842776] [2023-11-29 03:54:34,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:54:34,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-11-29 03:54:34,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:54:34,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-11-29 03:54:34,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=5675, Unknown=24, NotChecked=0, Total=6006 [2023-11-29 03:54:34,941 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 65 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 56 states have internal predecessors, (101), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:54:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:54:42,719 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2023-11-29 03:54:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 03:54:42,719 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 56 states have internal predecessors, (101), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2023-11-29 03:54:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:54:42,720 INFO L225 Difference]: With dead ends: 113 [2023-11-29 03:54:42,721 INFO L226 Difference]: Without dead ends: 113 [2023-11-29 03:54:42,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2874 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=655, Invalid=9827, Unknown=24, NotChecked=0, Total=10506 [2023-11-29 03:54:42,723 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 290 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1972 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:54:42,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1106 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1972 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 03:54:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-29 03:54:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2023-11-29 03:54:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:54:42,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2023-11-29 03:54:42,728 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 58 [2023-11-29 03:54:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:54:42,728 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2023-11-29 03:54:42,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 56 states have internal predecessors, (101), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:54:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2023-11-29 03:54:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 03:54:42,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:54:42,729 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:54:42,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-11-29 03:54:42,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-29 03:54:42,930 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-29 03:54:42,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1714516451, now seen corresponding path program 1 times [2023-11-29 03:54:42,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318654184] [2023-11-29 03:54:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:54:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:54:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:54:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:54:49,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:54:49,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318654184] [2023-11-29 03:54:49,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318654184] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:54:49,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818035510] [2023-11-29 03:54:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:49,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:54:49,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:54:49,141 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:54:49,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-29 03:54:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:49,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 03:54:49,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:54:50,274 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 27 treesize of output 1 [2023-11-29 03:54:50,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2023-11-29 03:54:50,420 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:54:50,420 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 15 treesize of output 7 [2023-11-29 03:54:50,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:54:51,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:54:51,057 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 22 treesize of output 17 [2023-11-29 03:54:51,077 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2023-11-29 03:54:51,078 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 28 treesize of output 30 [2023-11-29 03:54:51,849 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:54:51,850 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:54:51,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 8 [2023-11-29 03:54:52,053 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-29 03:54:52,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:54:52,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:54:52,553 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 19 treesize of output 11 [2023-11-29 03:54:52,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-11-29 03:54:52,571 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 32 treesize of output 19 [2023-11-29 03:54:53,160 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 50 treesize of output 30 [2023-11-29 03:54:53,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:54:53,322 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 34 treesize of output 30 [2023-11-29 03:54:53,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:54:53,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:54:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 03:54:53,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:54:54,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:54:54,274 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 236 treesize of output 217 [2023-11-29 03:54:54,288 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 166 treesize of output 138 [2023-11-29 03:54:55,019 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse0 (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 8))) (let ((.cse1 (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int)) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ v_arrayElimCell_331 8)) |c_ULTIMATE.start_main_~uneq~0#1|))) (.cse5 (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_7588))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse20 (+ v_arrayElimCell_331 8))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 .cse3)) (= (select .cse19 .cse20) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select .cse21 v_arrayElimCell_330) .cse20) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse2 (not .cse0)) (.cse4 (not .cse6)) (.cse9 (and (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse18 (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_7588) v_arrayElimCell_330))) (or (= (select .cse18 (+ v_arrayElimCell_331 8)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 .cse3))))) (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_7588) v_arrayElimCell_330) (+ v_arrayElimCell_331 8)) |c_ULTIMATE.start_main_~uneq~0#1|)))) (.cse7 (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_7588)) (.cse17 (+ v_arrayElimCell_331 8))) (or (= (select (select .cse16 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse17) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select .cse16 v_arrayElimCell_330) .cse17) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (and (or .cse0 .cse1) (or .cse2 (forall ((v_ArrVal_7588 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3))) .cse4) (or .cse5 .cse0) (or .cse6 .cse1) (or .cse0 .cse7) (or .cse6 .cse5) (or .cse2 (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_330 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_7588))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse8 v_arrayElimCell_330) .cse3))))) .cse4) (or .cse9 .cse0) (forall ((v_ArrVal_7588 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 .cse3)) (forall ((v_arrayElimCell_331 Int)) (= (select .cse10 (+ v_arrayElimCell_331 8)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse6 .cse9) (or .cse6 .cse7) (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_7588))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse12 (+ v_arrayElimCell_331 8)) (.cse13 (select .cse14 v_arrayElimCell_330))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 .cse3)) (= (select .cse11 .cse12) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse13 .cse12) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 .cse3)))))) (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int)) (let ((.cse15 (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 .cse3)) (= (select .cse15 (+ v_arrayElimCell_331 8)) |c_ULTIMATE.start_main_~uneq~0#1|))))))) is different from false [2023-11-29 03:54:55,224 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (= .cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 8))) (let ((.cse1 (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse21 (store |c_#memory_int#1| .cse7 v_ArrVal_7588)) (.cse22 (+ v_arrayElimCell_331 8))) (or (= (select (select .cse21 v_arrayElimCell_330) .cse22) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse22)))))) (.cse9 (and (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse20 (select (store |c_#memory_int#1| .cse7 v_ArrVal_7588) v_arrayElimCell_330))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse6)) (= (select .cse20 (+ v_arrayElimCell_331 8)) |c_ULTIMATE.start_main_~uneq~0#1|)))) (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (= (select (select (store |c_#memory_int#1| .cse7 v_ArrVal_7588) v_arrayElimCell_330) (+ v_arrayElimCell_331 8)) |c_ULTIMATE.start_main_~uneq~0#1|)))) (.cse3 (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| .cse7 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ v_arrayElimCell_331 8))))) (.cse2 (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse17 (store |c_#memory_int#1| .cse7 v_ArrVal_7588))) (let ((.cse18 (+ v_arrayElimCell_331 8)) (.cse19 (select .cse17 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (= (select (select .cse17 v_arrayElimCell_330) .cse18) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 .cse18)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 .cse6))))))) (.cse10 (not .cse4)) (.cse11 (not .cse0))) (and (or .cse0 .cse1) (or .cse2 .cse0) (or .cse3 .cse4) (or .cse1 .cse4) (forall ((v_ArrVal_7588 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int#1| .cse7 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (forall ((v_arrayElimCell_331 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 (+ v_arrayElimCell_331 8)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 .cse6))))) (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int)) (let ((.cse8 (select (store |c_#memory_int#1| .cse7 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 (+ v_arrayElimCell_331 8))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 .cse6))))) (or .cse9 .cse4) (or .cse9 .cse0) (or .cse3 .cse0) (or .cse10 .cse11 (forall ((v_ArrVal_7588 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| .cse7 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse6)))) (or .cse2 .cse4) (or .cse10 .cse11 (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_330 Int)) (let ((.cse12 (store |c_#memory_int#1| .cse7 v_ArrVal_7588))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_330) .cse6)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse6)))))) (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse16 (store |c_#memory_int#1| .cse7 v_ArrVal_7588))) (let ((.cse13 (select .cse16 v_arrayElimCell_330)) (.cse14 (+ v_arrayElimCell_331 8)) (.cse15 (select .cse16 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 .cse6)) (= (select .cse13 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 .cse14)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 .cse6)))))))))) is different from false [2023-11-29 03:54:55,549 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (= .cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse8 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 8)) (.cse6 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (let ((.cse5 (and (forall ((v_ArrVal_7585 (Array Int Int))) (or (not (= (store .cse6 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse23 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse9 v_ArrVal_7588) v_arrayElimCell_330))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 .cse8)) (= (select .cse23 (+ v_arrayElimCell_331 8)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (forall ((v_ArrVal_7585 (Array Int Int))) (or (not (= (store .cse6 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse9 v_ArrVal_7588) v_arrayElimCell_330) (+ v_arrayElimCell_331 8)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse4 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int)) (or (not (= (store .cse6 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse9 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ v_arrayElimCell_331 8)))))) (.cse0 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse21 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse9 v_ArrVal_7588)) (.cse22 (+ v_arrayElimCell_331 8))) (or (not (= (store .cse6 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse22)) (= (select (select .cse21 v_arrayElimCell_330) .cse22) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse11 (not .cse3)) (.cse12 (not .cse1)) (.cse2 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse9 v_ArrVal_7588))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse19 (+ v_arrayElimCell_331 8))) (or (= (select .cse18 .cse8) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store .cse6 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 .cse19)) (= (select (select .cse20 v_arrayElimCell_330) .cse19) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse4 .cse1) (or .cse1 .cse5) (forall ((v_ArrVal_7585 (Array Int Int))) (or (not (= (store .cse6 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (forall ((v_ArrVal_7588 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse9 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (= (select .cse7 .cse8) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_331 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 (+ v_arrayElimCell_331 8))))))))) (forall ((v_ArrVal_7585 (Array Int Int))) (or (not (= (store .cse6 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int)) (let ((.cse10 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse9 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (= (select .cse10 .cse8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 (+ v_arrayElimCell_331 8)))))))) (or .cse3 .cse5) (or .cse11 .cse12 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse9 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse8) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store .cse6 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585))))) (or .cse4 .cse3) (or .cse0 .cse3) (or .cse11 .cse12 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_330 Int)) (let ((.cse13 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse9 v_ArrVal_7588))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_330) .cse8)) (= (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse8) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store .cse6 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)))))) (forall ((v_ArrVal_7585 (Array Int Int))) (or (not (= (store .cse6 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (forall ((v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse17 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse9 v_ArrVal_7588))) (let ((.cse15 (select .cse17 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse14 (select .cse17 v_arrayElimCell_330)) (.cse16 (+ v_arrayElimCell_331 8))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 .cse8)) (= (select .cse15 .cse8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 .cse16)) (= (select .cse14 .cse16) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (or .cse2 .cse1))))) is different from false [2023-11-29 03:54:56,178 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (= .cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse15 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 8)) (.cse7 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4))) (let ((.cse1 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int)) (or (not (= v_ArrVal_7585 (store (store .cse7 .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse5 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ v_arrayElimCell_331 8)))))) (.cse2 (and (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (or (not (= v_ArrVal_7585 (store (store .cse7 .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse5 v_ArrVal_7588) v_arrayElimCell_330) (+ v_arrayElimCell_331 8)) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse23 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse5 v_ArrVal_7588) v_arrayElimCell_330))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 .cse6)) (not (= v_ArrVal_7585 (store (store .cse7 .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (= (select .cse23 (+ v_arrayElimCell_331 8)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse3 (not .cse15)) (.cse4 (not .cse0)) (.cse13 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse21 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse5 v_ArrVal_7588)) (.cse22 (+ v_arrayElimCell_331 8))) (or (not (= v_ArrVal_7585 (store (store .cse7 .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse22)) (= (select (select .cse21 v_arrayElimCell_330) .cse22) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse14 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse5 v_ArrVal_7588))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse19 (+ v_arrayElimCell_331 8))) (or (= (select .cse18 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_7585 (store (store .cse7 .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 .cse19)) (= (select (select .cse20 v_arrayElimCell_330) .cse19) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (and (or .cse0 .cse1) (or .cse2 .cse0) (or .cse3 .cse4 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse5 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse6) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_7585 (store (store .cse7 .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))))) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int)) (let ((.cse12 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse5 v_ArrVal_7588))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse9 (select .cse12 v_arrayElimCell_330)) (.cse11 (+ v_arrayElimCell_331 8))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 .cse6)) (= (select .cse10 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_7585 (store (store .cse7 .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 .cse11)) (= (select .cse9 .cse11) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse0 .cse13) (or .cse14 .cse0) (or .cse1 .cse15) (or .cse2 .cse15) (or .cse3 .cse4 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_330 Int)) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse5 v_ArrVal_7588))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse16 v_arrayElimCell_330) .cse6)) (= (select (select .cse16 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse6) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_7585 (store (store .cse7 .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))))))) (or .cse13 .cse15) (or .cse14 .cse15) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int)) (let ((.cse17 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse5 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (= (select .cse17 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_7585 (store (store .cse7 .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ v_arrayElimCell_331 8)))))))))) is different from false [2023-11-29 03:54:56,513 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse5 (= .cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse8 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4))) (let ((.cse6 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_7582))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse31 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse4 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ v_arrayElimCell_331 8))) (not (= v_ArrVal_7585 (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3 (select v_ArrVal_7585 .cse3)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))))))) (.cse7 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_7582))) (let ((.cse28 (store (store .cse30 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse4 v_ArrVal_7588)) (.cse29 (+ v_arrayElimCell_331 8))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 v_arrayElimCell_330) .cse29)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse29)) (not (= v_ArrVal_7585 (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3 (select v_ArrVal_7585 .cse3)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))))))) (.cse10 (and (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_7582))) (let ((.cse25 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse4 v_ArrVal_7588) v_arrayElimCell_330))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 .cse1)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ v_arrayElimCell_331 8))) (not (= v_ArrVal_7585 (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3 (select v_ArrVal_7585 .cse3)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))))))) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_7582))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse27 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse4 v_ArrVal_7588) v_arrayElimCell_330) (+ v_arrayElimCell_331 8))) (not (= v_ArrVal_7585 (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3 (select v_ArrVal_7585 .cse3)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))))))) (.cse9 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_7582))) (let ((.cse22 (store (store .cse24 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse4 v_ArrVal_7588))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse23 (+ v_arrayElimCell_331 8))) (or (= (select .cse21 .cse1) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse22 v_arrayElimCell_330) .cse23)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 .cse23)) (not (= v_ArrVal_7585 (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3 (select v_ArrVal_7585 .cse3)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))))))))) (.cse11 (not .cse8)) (.cse12 (not .cse5))) (and (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_7582))) (let ((.cse0 (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse4 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (= (select .cse0 .cse1) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 (+ v_arrayElimCell_331 8))) (not (= v_ArrVal_7585 (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3 (select v_ArrVal_7585 .cse3)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))))))) (or .cse5 .cse6) (or .cse7 .cse5) (or .cse6 .cse8) (or .cse9 .cse8) (or .cse7 .cse8) (or .cse10 .cse5) (or .cse10 .cse8) (or .cse11 .cse12 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_ArrVal_7582 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_7582))) (or (= (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse4 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse1) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_7585 (store (store (select .cse13 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3 (select v_ArrVal_7585 .cse3)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))))))) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_7582))) (let ((.cse18 (store (store .cse17 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse4 v_ArrVal_7588))) (let ((.cse14 (select .cse18 v_arrayElimCell_330)) (.cse15 (select .cse18 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse16 (+ v_arrayElimCell_331 8))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 .cse1)) (= (select .cse15 .cse1) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 .cse16)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 .cse16)) (not (= v_ArrVal_7585 (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3 (select v_ArrVal_7585 .cse3)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))))))) (or .cse9 .cse5) (or .cse11 .cse12 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_7582))) (let ((.cse19 (store (store .cse20 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse4 v_ArrVal_7588))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 v_arrayElimCell_330) .cse1)) (= (select (select .cse19 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse1) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_7585 (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3 (select v_ArrVal_7585 .cse3)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))))))))))) is different from false [2023-11-29 03:54:56,811 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse2 (= .cse11 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse9 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse0 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse30 (store |c_#memory_int#1| .cse12 v_ArrVal_7582))) (let ((.cse31 (store (store .cse30 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse11 v_ArrVal_7588)) (.cse32 (+ v_arrayElimCell_331 8))) (or (not (= (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse31 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse32)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse31 v_arrayElimCell_330) .cse32))))))) (.cse3 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| .cse12 v_ArrVal_7582))) (let ((.cse29 (store (store .cse26 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse11 v_ArrVal_7588))) (let ((.cse28 (+ v_arrayElimCell_331 8)) (.cse27 (select .cse29 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 .cse28)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse29 v_arrayElimCell_330) .cse28)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 .cse9)))))))) (.cse14 (not .cse1)) (.cse17 (not .cse2)) (.cse19 (and (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#1| .cse12 v_ArrVal_7582))) (or (not (= (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse11 v_ArrVal_7588) v_arrayElimCell_330) (+ v_arrayElimCell_331 8)))))) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| .cse12 v_ArrVal_7582))) (let ((.cse25 (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse11 v_ArrVal_7588) v_arrayElimCell_330))) (or (not (= (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ v_arrayElimCell_331 8))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 .cse9)))))))) (.cse13 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| .cse12 v_ArrVal_7582))) (or (not (= (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse11 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ v_arrayElimCell_331 8)))))))) (and (or .cse0 .cse1) (or .cse2 .cse3) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#1| .cse12 v_ArrVal_7582))) (let ((.cse10 (store (store .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse11 v_ArrVal_7588))) (let ((.cse7 (+ v_arrayElimCell_331 8)) (.cse6 (select .cse10 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse8 (select .cse10 v_arrayElimCell_330))) (or (not (= (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse6 .cse7)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 .cse7)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse6 .cse9)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 .cse9))))))) (or .cse2 .cse13) (or .cse0 .cse2) (or .cse3 .cse1) (or .cse14 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| .cse12 v_ArrVal_7582))) (let ((.cse16 (store (store .cse15 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse11 v_ArrVal_7588))) (or (not (= (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse16 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse9)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse16 v_arrayElimCell_330) .cse9)))))) .cse17) (or .cse14 .cse17 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_ArrVal_7582 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| .cse12 v_ArrVal_7582))) (or (not (= (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse18 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse11 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse9)))))) (or .cse19 .cse1) (or .cse2 .cse19) (or .cse13 .cse1) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| .cse12 v_ArrVal_7582))) (let ((.cse21 (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse11 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (not (= (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ v_arrayElimCell_331 8))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 .cse9)))))))))) is different from false [2023-11-29 03:54:57,092 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse33 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse13 (= .cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse10 (= .cse33 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ .cse33 4)))) (let ((.cse12 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| .cse8 v_ArrVal_7582))) (let ((.cse30 (store (store .cse32 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse7 v_ArrVal_7588)) (.cse31 (+ v_arrayElimCell_331 8))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse30 v_arrayElimCell_330) .cse31)) (not (= (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse30 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse31))))))) (.cse11 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| .cse8 v_ArrVal_7582))) (let ((.cse26 (store (store .cse29 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse7 v_ArrVal_7588))) (let ((.cse28 (select .cse26 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse27 (+ v_arrayElimCell_331 8))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse26 v_arrayElimCell_330) .cse27)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 .cse3)) (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 .cse27)))))))) (.cse9 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| .cse8 v_ArrVal_7582))) (or (not (= (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse7 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ v_arrayElimCell_331 8))))))) (.cse16 (and (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| .cse8 v_ArrVal_7582))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse7 v_ArrVal_7588) v_arrayElimCell_330) (+ v_arrayElimCell_331 8))) (not (= (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585))))) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| .cse8 v_ArrVal_7582))) (let ((.cse23 (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse7 v_ArrVal_7588) v_arrayElimCell_330))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ v_arrayElimCell_331 8))) (not (= (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= (select .cse23 .cse3) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (.cse17 (not .cse10)) (.cse18 (not .cse13))) (and (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#1| .cse8 v_ArrVal_7582))) (let ((.cse6 (store (store .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse7 v_ArrVal_7588))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse1 (+ v_arrayElimCell_331 8)) (.cse0 (select .cse6 v_arrayElimCell_330))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse2 .cse3)) (not (= (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse2 .cse1)) (= (select .cse0 .cse3) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or .cse9 .cse10) (or .cse11 .cse10) (or .cse12 .cse13) (or .cse12 .cse10) (or .cse13 .cse11) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| .cse8 v_ArrVal_7582))) (let ((.cse14 (select (store (store .cse15 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse7 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 .cse3)) (not (= (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 (+ v_arrayElimCell_331 8))))))) (or .cse16 .cse10) (or .cse9 .cse13) (or .cse17 .cse18 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| .cse8 v_ArrVal_7582))) (let ((.cse19 (store (store .cse20 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse7 v_ArrVal_7588))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3)) (not (= (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585)) (= (select (select .cse19 v_arrayElimCell_330) .cse3) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or .cse16 .cse13) (or .cse17 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_ArrVal_7582 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| .cse8 v_ArrVal_7582))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7585) .cse7 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse3)) (not (= (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse5 (select v_ArrVal_7585 .cse5)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_7585))))) .cse18))))) is different from false [2023-11-29 03:54:58,125 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse33 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse4 (+ 8 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) (.cse0 (= .cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse13 (= .cse33 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse8 (+ 4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse10) (+ .cse33 4)))) (let ((.cse1 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| .cse11 v_ArrVal_7582))) (or (not (= v_ArrVal_7585 (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse32 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_7585) .cse10 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (+ v_arrayElimCell_331 8))))))) (.cse14 (not .cse13)) (.cse15 (not .cse0)) (.cse12 (and (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| .cse11 v_ArrVal_7582))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_7585) .cse10 v_ArrVal_7588) v_arrayElimCell_330) (+ v_arrayElimCell_331 8))) (not (= v_ArrVal_7585 (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))))))) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#1| .cse11 v_ArrVal_7582))) (let ((.cse30 (select (store (store .cse31 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_7585) .cse10 v_ArrVal_7588) v_arrayElimCell_330))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ v_arrayElimCell_331 8))) (not (= v_ArrVal_7585 (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))))))))) (.cse19 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| .cse11 v_ArrVal_7582))) (let ((.cse26 (store (store .cse28 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_7585) .cse10 v_ArrVal_7588))) (let ((.cse25 (select .cse26 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (.cse27 (+ v_arrayElimCell_331 8))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse26 v_arrayElimCell_330) .cse27)) (not (= v_ArrVal_7585 (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 .cse27)))))))) (.cse2 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| .cse11 v_ArrVal_7582))) (let ((.cse22 (store (store .cse24 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_7585) .cse10 v_ArrVal_7588)) (.cse23 (+ v_arrayElimCell_331 8))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse22 v_arrayElimCell_330) .cse23)) (not (= v_ArrVal_7585 (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse22 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse23)))))))) (and (or .cse0 .cse1) (or .cse2 .cse0) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| .cse11 v_ArrVal_7582))) (let ((.cse9 (store (store .cse7 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_7585) .cse10 v_ArrVal_7588))) (let ((.cse5 (select .cse9 v_arrayElimCell_330)) (.cse3 (select .cse9 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (.cse6 (+ v_arrayElimCell_331 8))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse3 .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 .cse6)) (not (= v_ArrVal_7585 (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse3 .cse6))))))) (or .cse12 .cse13) (or .cse1 .cse13) (or .cse14 .cse15 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_330 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| .cse11 v_ArrVal_7582))) (let ((.cse16 (store (store .cse17 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_7585) .cse10 v_ArrVal_7588))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse16 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse16 v_arrayElimCell_330) .cse4)) (not (= v_ArrVal_7585 (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))))))))) (or .cse14 .cse15 (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_ArrVal_7582 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| .cse11 v_ArrVal_7582))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse18 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_7585) .cse10 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse4)) (not (= v_ArrVal_7585 (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))))))) (or .cse19 .cse0) (forall ((v_ArrVal_7585 (Array Int Int)) (v_ArrVal_7588 (Array Int Int)) (v_arrayElimCell_331 Int) (v_ArrVal_7582 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| .cse11 v_ArrVal_7582))) (let ((.cse20 (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_7585) .cse10 v_ArrVal_7588) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse4)) (not (= v_ArrVal_7585 (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse8 (select v_ArrVal_7585 .cse8)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (select v_ArrVal_7585 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ v_arrayElimCell_331 8))))))) (or .cse12 .cse0) (or .cse19 .cse13) (or .cse2 .cse13))))) is different from false [2023-11-29 03:55:03,737 WARN L293 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 514 DAG size of output: 361 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 03:55:03,737 INFO L349 Elim1Store]: treesize reduction 546, result has 57.1 percent of original size [2023-11-29 03:55:03,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 14 new quantified variables, introduced 92 case distinctions, treesize of input 11040 treesize of output 11449 [2023-11-29 03:55:04,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:55:04,318 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 3808 treesize of output 3793 [2023-11-29 03:55:05,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:55:05,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 4542 treesize of output 4926 [2023-11-29 03:55:06,568 INFO L349 Elim1Store]: treesize reduction 46, result has 48.9 percent of original size [2023-11-29 03:55:06,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 4288 treesize of output 4316 [2023-11-29 03:55:07,580 INFO L349 Elim1Store]: treesize reduction 38, result has 50.0 percent of original size [2023-11-29 03:55:07,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 4274 treesize of output 4298 [2023-11-29 03:55:08,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4260 treesize of output 4244 [2023-11-29 03:55:08,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:55:08,673 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 4244 treesize of output 4251 [2023-11-29 03:55:09,382 INFO L349 Elim1Store]: treesize reduction 38, result has 50.0 percent of original size [2023-11-29 03:55:09,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 4234 treesize of output 4258 [2023-11-29 03:55:09,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:55:09,990 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 4220 treesize of output 4227 [2023-11-29 03:55:10,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:55:10,652 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 4210 treesize of output 4197 [2023-11-29 03:55:11,393 INFO L349 Elim1Store]: treesize reduction 38, result has 50.0 percent of original size [2023-11-29 03:55:11,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 4188 treesize of output 4212 [2023-11-29 03:55:12,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:55:12,031 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 4174 treesize of output 4181 [2023-11-29 03:55:12,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4164 treesize of output 4160 [2023-11-29 03:55:13,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4160 treesize of output 4140 [2023-11-29 03:55:14,039 INFO L349 Elim1Store]: treesize reduction 46, result has 48.9 percent of original size [2023-11-29 03:55:14,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 4140 treesize of output 4168 [2023-11-29 03:55:15,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4126 treesize of output 4106 [2023-11-29 03:55:16,041 INFO L349 Elim1Store]: treesize reduction 38, result has 50.0 percent of original size [2023-11-29 03:55:16,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 4106 treesize of output 4130 [2023-11-29 03:55:16,868 INFO L349 Elim1Store]: treesize reduction 46, result has 48.9 percent of original size [2023-11-29 03:55:16,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 4092 treesize of output 4120 [2023-11-29 03:55:18,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:55:18,243 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 4078 treesize of output 4081 [2023-11-29 03:55:18,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:55:18,951 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 4072 treesize of output 4079 [2023-11-29 03:55:19,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4062 treesize of output 4058 [2023-11-29 03:55:20,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:55:20,514 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 4058 treesize of output 4045 [2023-11-29 03:55:21,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:55:21,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 4036 treesize of output 4047 [2023-11-29 03:55:22,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4026 treesize of output 4016 [2023-11-29 03:55:23,842 INFO L349 Elim1Store]: treesize reduction 38, result has 50.0 percent of original size [2023-11-29 03:55:23,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 4016 treesize of output 4040 [2023-11-29 03:55:24,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4002 treesize of output 4000 [2023-11-29 03:55:25,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:55:25,602 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 4000 treesize of output 3985 [2023-11-29 03:55:26,552 INFO L349 Elim1Store]: treesize reduction 38, result has 50.0 percent of original size [2023-11-29 03:55:26,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 3976 treesize of output 4000 [2023-11-29 03:55:27,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3962 treesize of output 3946 [2023-11-29 03:55:28,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:55:28,304 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 3946 treesize of output 3925 [2023-11-29 03:56:41,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 03:56:41,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:56:41,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2023-11-29 03:57:25,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 03:57:25,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 7 treesize of output 3 [2023-11-29 03:58:16,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 03:58:16,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-29 03:58:35,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 03:58:35,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:03:45,006 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 04:03:45,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-11-29 04:03:45,007 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 04:03:45,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-11-29 04:03:45,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-11-29 04:03:45,208 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:364) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 67 more [2023-11-29 04:03:45,210 INFO L158 Benchmark]: Toolchain (without parser) took 826423.23ms. Allocated memory was 138.4MB in the beginning and 536.9MB in the end (delta: 398.5MB). Free memory was 101.2MB in the beginning and 217.2MB in the end (delta: -116.0MB). Peak memory consumption was 354.5MB. Max. memory is 16.1GB. [2023-11-29 04:03:45,210 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 138.4MB. Free memory was 108.5MB in the beginning and 108.4MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:03:45,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.32ms. Allocated memory is still 138.4MB. Free memory was 101.2MB in the beginning and 83.2MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 04:03:45,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.75ms. Allocated memory is still 138.4MB. Free memory was 82.7MB in the beginning and 80.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:03:45,211 INFO L158 Benchmark]: Boogie Preprocessor took 67.41ms. Allocated memory is still 138.4MB. Free memory was 80.6MB in the beginning and 76.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:03:45,211 INFO L158 Benchmark]: RCFGBuilder took 832.63ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 76.9MB in the beginning and 139.5MB in the end (delta: -62.6MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2023-11-29 04:03:45,211 INFO L158 Benchmark]: TraceAbstraction took 824921.26ms. Allocated memory was 176.2MB in the beginning and 536.9MB in the end (delta: 360.7MB). Free memory was 138.5MB in the beginning and 217.2MB in the end (delta: -78.7MB). Peak memory consumption was 352.2MB. Max. memory is 16.1GB. [2023-11-29 04:03:45,212 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 138.4MB. Free memory was 108.5MB in the beginning and 108.4MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.32ms. Allocated memory is still 138.4MB. Free memory was 101.2MB in the beginning and 83.2MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.75ms. Allocated memory is still 138.4MB. Free memory was 82.7MB in the beginning and 80.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.41ms. Allocated memory is still 138.4MB. Free memory was 80.6MB in the beginning and 76.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 832.63ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 76.9MB in the beginning and 139.5MB in the end (delta: -62.6MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * TraceAbstraction took 824921.26ms. Allocated memory was 176.2MB in the beginning and 536.9MB in the end (delta: 360.7MB). Free memory was 138.5MB in the beginning and 217.2MB in the end (delta: -78.7MB). Peak memory consumption was 352.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya --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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:03:46,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:03:46,970 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e6c2e3-e9ad-4d96-bf2d-9c88330ac438/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:03:46,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:03:46,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:03:47,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:03:47,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:03:47,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:03:47,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:03:47,006 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:03:47,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:03:47,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:03:47,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:03:47,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:03:47,009 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:03:47,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:03:47,010 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:03:47,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:03:47,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:03:47,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:03:47,012 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:03:47,013 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:03:47,013 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:03:47,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:03:47,014 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:03:47,014 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:03:47,015 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:03:47,015 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:03:47,015 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:03:47,016 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:03:47,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:03:47,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:03:47,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:03:47,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:03:47,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:03:47,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:03:47,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:03:47,019 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:03:47,019 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:03:47,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:03:47,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:03:47,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:03:47,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:03:47,020 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:03:47,021 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC