./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0504.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/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_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0504.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/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_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/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 cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:41:10,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:41:10,434 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 06:41:10,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:41:10,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:41:10,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:41:10,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:41:10,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:41:10,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:41:10,470 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:41:10,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:41:10,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:41:10,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:41:10,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:41:10,473 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:41:10,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:41:10,475 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:41:10,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:41:10,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:41:10,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:41:10,477 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:41:10,477 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:41:10,478 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:41:10,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:41:10,479 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:41:10,479 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:41:10,480 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:41:10,480 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:41:10,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:41:10,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:41:10,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:41:10,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:41:10,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:41:10,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:41:10,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:41:10,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:41:10,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:41:10,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:41:10,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:41:10,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:41:10,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:41:10,485 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_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/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_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/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 -> cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 [2023-11-29 06:41:10,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:41:10,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:41:10,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:41:10,738 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:41:10,739 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:41:10,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/memsafety/test-0504.i [2023-11-29 06:41:13,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:41:13,882 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:41:13,882 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/sv-benchmarks/c/memsafety/test-0504.i [2023-11-29 06:41:13,899 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/data/32c41865f/2ca134d061384f31b4f317381e58aeba/FLAGf9428364b [2023-11-29 06:41:13,917 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/data/32c41865f/2ca134d061384f31b4f317381e58aeba [2023-11-29 06:41:13,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:41:13,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:41:13,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:41:13,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:41:13,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:41:13,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488cc108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13, skipping insertion in model container [2023-11-29 06:41:13,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,987 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:41:14,310 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:41:14,322 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:41:14,367 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:41:14,402 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:41:14,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14 WrapperNode [2023-11-29 06:41:14,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:41:14,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:41:14,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:41:14,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:41:14,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (1/1) ... [2023-11-29 06:41:14,427 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (1/1) ... [2023-11-29 06:41:14,454 INFO L138 Inliner]: procedures = 123, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 90 [2023-11-29 06:41:14,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:41:14,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:41:14,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:41:14,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:41:14,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (1/1) ... [2023-11-29 06:41:14,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (1/1) ... [2023-11-29 06:41:14,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (1/1) ... [2023-11-29 06:41:14,497 INFO L175 MemorySlicer]: Split 19 memory accesses to 2 slices as follows [2, 17]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2023-11-29 06:41:14,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (1/1) ... [2023-11-29 06:41:14,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (1/1) ... [2023-11-29 06:41:14,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (1/1) ... [2023-11-29 06:41:14,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (1/1) ... [2023-11-29 06:41:14,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (1/1) ... [2023-11-29 06:41:14,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (1/1) ... [2023-11-29 06:41:14,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:41:14,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:41:14,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:41:14,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:41:14,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (1/1) ... [2023-11-29 06:41:14,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:41:14,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:14,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:41:14,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:41:14,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:41:14,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:41:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:41:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:41:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:41:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:41:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:41:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:41:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:41:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:41:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:41:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:41:14,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:41:14,729 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:41:14,731 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:41:15,030 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:41:15,067 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:41:15,067 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 06:41:15,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:41:15 BoogieIcfgContainer [2023-11-29 06:41:15,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:41:15,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:41:15,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:41:15,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:41:15,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:41:13" (1/3) ... [2023-11-29 06:41:15,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf7e855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:41:15, skipping insertion in model container [2023-11-29 06:41:15,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:14" (2/3) ... [2023-11-29 06:41:15,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf7e855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:41:15, skipping insertion in model container [2023-11-29 06:41:15,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:41:15" (3/3) ... [2023-11-29 06:41:15,078 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0504.i [2023-11-29 06:41:15,100 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:41:15,100 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-29 06:41:15,150 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:41:15,157 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;@3415eae3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:41:15,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-29 06:41:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 06:41:15,166 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:15,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 06:41:15,167 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:15,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash 5514601, now seen corresponding path program 1 times [2023-11-29 06:41:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:15,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597096324] [2023-11-29 06:41:15,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:15,333 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 06:41:15,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:15,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597096324] [2023-11-29 06:41:15,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597096324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:15,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:15,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:15,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007284232] [2023-11-29 06:41:15,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:15,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:41:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:41:15,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:41:15,383 INFO L87 Difference]: Start difference. First operand has 78 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:15,431 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2023-11-29 06:41:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:41:15,436 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 06:41:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:15,446 INFO L225 Difference]: With dead ends: 78 [2023-11-29 06:41:15,446 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 06:41:15,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:41:15,452 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:15,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:41:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 06:41:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-29 06:41:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 36 states have (on average 2.25) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-11-29 06:41:15,496 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 4 [2023-11-29 06:41:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:15,497 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-11-29 06:41:15,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-11-29 06:41:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 06:41:15,498 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:15,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:41:15,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:41:15,499 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:15,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:15,500 INFO L85 PathProgramCache]: Analyzing trace with hash 168302235, now seen corresponding path program 1 times [2023-11-29 06:41:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588822418] [2023-11-29 06:41:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:15,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:15,576 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 06:41:15,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:15,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588822418] [2023-11-29 06:41:15,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588822418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:15,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:15,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173639234] [2023-11-29 06:41:15,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:15,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:15,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:15,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:15,581 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:15,675 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2023-11-29 06:41:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:15,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 06:41:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:15,678 INFO L225 Difference]: With dead ends: 121 [2023-11-29 06:41:15,678 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 06:41:15,679 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 06:41:15,680 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 45 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:15,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:15,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 06:41:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2023-11-29 06:41:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 56 states have (on average 2.267857142857143) internal successors, (127), 96 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 127 transitions. [2023-11-29 06:41:15,695 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 127 transitions. Word has length 5 [2023-11-29 06:41:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:15,695 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 127 transitions. [2023-11-29 06:41:15,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 127 transitions. [2023-11-29 06:41:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 06:41:15,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:15,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:41:15,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:41:15,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:15,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash 168301438, now seen corresponding path program 1 times [2023-11-29 06:41:15,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:15,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573236419] [2023-11-29 06:41:15,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:15,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:15,782 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 06:41:15,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:15,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573236419] [2023-11-29 06:41:15,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573236419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:15,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:15,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:15,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755534680] [2023-11-29 06:41:15,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:15,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:15,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:15,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:15,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:15,786 INFO L87 Difference]: Start difference. First operand 97 states and 127 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:15,884 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2023-11-29 06:41:15,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:15,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 06:41:15,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:15,886 INFO L225 Difference]: With dead ends: 89 [2023-11-29 06:41:15,886 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 06:41:15,886 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 06:41:15,888 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:15,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 56 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 06:41:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-29 06:41:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 2.0) internal successors, (112), 88 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2023-11-29 06:41:15,899 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 5 [2023-11-29 06:41:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:15,899 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2023-11-29 06:41:15,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2023-11-29 06:41:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 06:41:15,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:15,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:41:15,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:41:15,901 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:15,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash 168301439, now seen corresponding path program 1 times [2023-11-29 06:41:15,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:15,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650844896] [2023-11-29 06:41:15,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:15,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:16,005 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 06:41:16,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:16,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650844896] [2023-11-29 06:41:16,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650844896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:16,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:16,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:16,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650570647] [2023-11-29 06:41:16,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:16,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:16,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:16,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:16,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:16,008 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:16,098 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2023-11-29 06:41:16,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:16,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 06:41:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:16,100 INFO L225 Difference]: With dead ends: 95 [2023-11-29 06:41:16,100 INFO L226 Difference]: Without dead ends: 95 [2023-11-29 06:41:16,101 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 06:41:16,102 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:16,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 83 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-29 06:41:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2023-11-29 06:41:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.819672131147541) internal successors, (111), 88 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2023-11-29 06:41:16,111 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 5 [2023-11-29 06:41:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:16,112 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2023-11-29 06:41:16,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2023-11-29 06:41:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 06:41:16,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:16,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 06:41:16,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:41:16,113 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:16,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash 922401389, now seen corresponding path program 1 times [2023-11-29 06:41:16,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:16,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640082400] [2023-11-29 06:41:16,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:16,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:16,141 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 06:41:16,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:16,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640082400] [2023-11-29 06:41:16,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640082400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:16,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:16,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:41:16,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871547081] [2023-11-29 06:41:16,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:16,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:16,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:16,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:16,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:16,144 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:16,207 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2023-11-29 06:41:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 06:41:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:16,209 INFO L225 Difference]: With dead ends: 91 [2023-11-29 06:41:16,210 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 06:41:16,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:16,211 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:16,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 06:41:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-29 06:41:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 87 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2023-11-29 06:41:16,221 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 6 [2023-11-29 06:41:16,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:16,222 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2023-11-29 06:41:16,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2023-11-29 06:41:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 06:41:16,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:16,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:16,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:41:16,224 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:16,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1271598662, now seen corresponding path program 1 times [2023-11-29 06:41:16,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:16,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678459617] [2023-11-29 06:41:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:16,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:16,551 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 06:41:16,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:16,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678459617] [2023-11-29 06:41:16,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678459617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:16,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:16,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:41:16,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739749552] [2023-11-29 06:41:16,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:16,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:41:16,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:16,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:41:16,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:41:16,554 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:16,663 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2023-11-29 06:41:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:41:16,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 06:41:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:16,665 INFO L225 Difference]: With dead ends: 85 [2023-11-29 06:41:16,665 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 06:41:16,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:41:16,667 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 67 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:16,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 57 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 06:41:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2023-11-29 06:41:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 79 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2023-11-29 06:41:16,675 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 13 [2023-11-29 06:41:16,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:16,676 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2023-11-29 06:41:16,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:16,676 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2023-11-29 06:41:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 06:41:16,677 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:16,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:16,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:41:16,677 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:16,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash 764852851, now seen corresponding path program 1 times [2023-11-29 06:41:16,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:16,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937329991] [2023-11-29 06:41:16,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:16,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:16,760 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 06:41:16,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:16,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937329991] [2023-11-29 06:41:16,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937329991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:16,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:16,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:16,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392737480] [2023-11-29 06:41:16,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:16,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:16,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:16,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:16,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:16,763 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:16,823 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2023-11-29 06:41:16,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:16,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 06:41:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:16,825 INFO L225 Difference]: With dead ends: 76 [2023-11-29 06:41:16,825 INFO L226 Difference]: Without dead ends: 76 [2023-11-29 06:41:16,825 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 06:41:16,826 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:16,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 66 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-29 06:41:16,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-29 06:41:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 75 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2023-11-29 06:41:16,832 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 14 [2023-11-29 06:41:16,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:16,832 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2023-11-29 06:41:16,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2023-11-29 06:41:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 06:41:16,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:16,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:16,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:41:16,834 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:16,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash 764852852, now seen corresponding path program 1 times [2023-11-29 06:41:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:16,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775733033] [2023-11-29 06:41:16,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:16,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:16,967 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 06:41:16,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:16,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775733033] [2023-11-29 06:41:16,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775733033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:16,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:16,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:16,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233124995] [2023-11-29 06:41:16,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:16,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:16,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:16,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:16,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:16,973 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:17,049 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2023-11-29 06:41:17,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:17,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 06:41:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:17,051 INFO L225 Difference]: With dead ends: 72 [2023-11-29 06:41:17,051 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 06:41:17,051 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 06:41:17,052 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:17,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 71 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 06:41:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-29 06:41:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2023-11-29 06:41:17,057 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 14 [2023-11-29 06:41:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:17,057 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2023-11-29 06:41:17,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2023-11-29 06:41:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 06:41:17,058 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:17,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:17,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:41:17,059 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:17,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:17,059 INFO L85 PathProgramCache]: Analyzing trace with hash 584274389, now seen corresponding path program 1 times [2023-11-29 06:41:17,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:17,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981128540] [2023-11-29 06:41:17,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:17,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:17,330 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 06:41:17,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:17,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981128540] [2023-11-29 06:41:17,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981128540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:17,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:17,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:41:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732210481] [2023-11-29 06:41:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:17,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:41:17,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:41:17,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:41:17,332 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:17,486 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2023-11-29 06:41:17,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:41:17,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 06:41:17,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:17,488 INFO L225 Difference]: With dead ends: 100 [2023-11-29 06:41:17,488 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 06:41:17,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:41:17,489 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:17,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 148 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 06:41:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2023-11-29 06:41:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 85 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2023-11-29 06:41:17,495 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 16 [2023-11-29 06:41:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:17,495 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2023-11-29 06:41:17,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2023-11-29 06:41:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 06:41:17,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:17,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:17,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:41:17,497 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:17,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:17,497 INFO L85 PathProgramCache]: Analyzing trace with hash 584274390, now seen corresponding path program 1 times [2023-11-29 06:41:17,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:17,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221135466] [2023-11-29 06:41:17,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:18,117 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 06:41:18,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:18,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221135466] [2023-11-29 06:41:18,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221135466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:18,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:18,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:41:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617028662] [2023-11-29 06:41:18,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:18,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:41:18,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:18,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:41:18,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:41:18,119 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:18,419 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2023-11-29 06:41:18,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:41:18,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 06:41:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:18,421 INFO L225 Difference]: With dead ends: 93 [2023-11-29 06:41:18,421 INFO L226 Difference]: Without dead ends: 93 [2023-11-29 06:41:18,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:41:18,422 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 77 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:18,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 183 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:41:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-29 06:41:18,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2023-11-29 06:41:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 85 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-11-29 06:41:18,427 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 16 [2023-11-29 06:41:18,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:18,427 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-11-29 06:41:18,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,428 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-11-29 06:41:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 06:41:18,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:18,429 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:18,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:41:18,429 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:18,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:18,430 INFO L85 PathProgramCache]: Analyzing trace with hash 77798928, now seen corresponding path program 1 times [2023-11-29 06:41:18,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:18,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274902183] [2023-11-29 06:41:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274902183] [2023-11-29 06:41:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274902183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:18,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:41:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598976035] [2023-11-29 06:41:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:18,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:41:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:18,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:41:18,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:41:18,502 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:18,624 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2023-11-29 06:41:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:41:18,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 06:41:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:18,626 INFO L225 Difference]: With dead ends: 94 [2023-11-29 06:41:18,626 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 06:41:18,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:41:18,627 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 44 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:18,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 68 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 06:41:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2023-11-29 06:41:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 87 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2023-11-29 06:41:18,632 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 17 [2023-11-29 06:41:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:18,632 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2023-11-29 06:41:18,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2023-11-29 06:41:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 06:41:18,634 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:18,634 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:18,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:41:18,634 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:18,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:18,635 INFO L85 PathProgramCache]: Analyzing trace with hash 77798929, now seen corresponding path program 1 times [2023-11-29 06:41:18,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:18,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560932852] [2023-11-29 06:41:18,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:18,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:18,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560932852] [2023-11-29 06:41:18,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560932852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:18,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:18,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:41:18,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38663596] [2023-11-29 06:41:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:18,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:41:18,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:18,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:41:18,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:41:18,757 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:18,876 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-11-29 06:41:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:41:18,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 06:41:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:18,879 INFO L225 Difference]: With dead ends: 116 [2023-11-29 06:41:18,879 INFO L226 Difference]: Without dead ends: 116 [2023-11-29 06:41:18,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:41:18,880 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 27 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:18,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 95 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-29 06:41:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2023-11-29 06:41:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 105 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2023-11-29 06:41:18,884 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 17 [2023-11-29 06:41:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:18,885 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2023-11-29 06:41:18,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2023-11-29 06:41:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 06:41:18,886 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:18,886 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:18,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:41:18,886 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:18,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:18,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1883201128, now seen corresponding path program 1 times [2023-11-29 06:41:18,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:18,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505378560] [2023-11-29 06:41:18,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:18,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:18,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:18,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505378560] [2023-11-29 06:41:18,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505378560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:18,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:18,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:41:18,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102683402] [2023-11-29 06:41:18,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:18,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:41:18,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:18,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:41:18,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:41:18,944 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:19,025 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-11-29 06:41:19,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:41:19,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-29 06:41:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:19,027 INFO L225 Difference]: With dead ends: 109 [2023-11-29 06:41:19,027 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 06:41:19,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:41:19,028 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:19,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 103 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:19,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 06:41:19,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2023-11-29 06:41:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 104 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2023-11-29 06:41:19,033 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 18 [2023-11-29 06:41:19,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:19,033 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2023-11-29 06:41:19,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,034 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2023-11-29 06:41:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 06:41:19,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:19,034 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:19,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:41:19,035 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:19,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:19,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1883198932, now seen corresponding path program 1 times [2023-11-29 06:41:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:19,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313680489] [2023-11-29 06:41:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:19,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 06:41:19,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:19,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313680489] [2023-11-29 06:41:19,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313680489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:19,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:19,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:41:19,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990277267] [2023-11-29 06:41:19,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:19,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:41:19,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:19,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:41:19,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:41:19,099 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:19,187 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2023-11-29 06:41:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:41:19,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-29 06:41:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:19,188 INFO L225 Difference]: With dead ends: 119 [2023-11-29 06:41:19,188 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 06:41:19,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 06:41:19,189 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:19,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 06:41:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2023-11-29 06:41:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 107 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2023-11-29 06:41:19,194 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 18 [2023-11-29 06:41:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:19,194 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2023-11-29 06:41:19,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2023-11-29 06:41:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 06:41:19,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:19,195 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:19,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:41:19,196 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:19,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:19,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1883198931, now seen corresponding path program 1 times [2023-11-29 06:41:19,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:19,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37556701] [2023-11-29 06:41:19,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:19,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37556701] [2023-11-29 06:41:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37556701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:19,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:19,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:41:19,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876616387] [2023-11-29 06:41:19,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:19,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:41:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:41:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:41:19,342 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:19,522 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2023-11-29 06:41:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:41:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-29 06:41:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:19,524 INFO L225 Difference]: With dead ends: 136 [2023-11-29 06:41:19,524 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 06:41:19,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:19,527 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:19,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 94 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 06:41:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 117. [2023-11-29 06:41:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.386138613861386) internal successors, (140), 116 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2023-11-29 06:41:19,531 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 140 transitions. Word has length 18 [2023-11-29 06:41:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:19,532 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 140 transitions. [2023-11-29 06:41:19,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 140 transitions. [2023-11-29 06:41:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 06:41:19,533 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:19,533 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:19,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:41:19,533 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:19,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:19,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1572894020, now seen corresponding path program 1 times [2023-11-29 06:41:19,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718137134] [2023-11-29 06:41:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:19,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718137134] [2023-11-29 06:41:19,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718137134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:19,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:19,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:41:19,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360977993] [2023-11-29 06:41:19,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:19,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:41:19,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:19,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:41:19,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:41:19,803 INFO L87 Difference]: Start difference. First operand 117 states and 140 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:19,978 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2023-11-29 06:41:19,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:41:19,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 06:41:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:19,980 INFO L225 Difference]: With dead ends: 136 [2023-11-29 06:41:19,980 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 06:41:19,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:41:19,981 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 24 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:19,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 155 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 06:41:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2023-11-29 06:41:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 123 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 148 transitions. [2023-11-29 06:41:19,986 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 148 transitions. Word has length 20 [2023-11-29 06:41:19,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:19,986 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 148 transitions. [2023-11-29 06:41:19,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 148 transitions. [2023-11-29 06:41:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 06:41:19,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:19,987 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:19,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 06:41:19,988 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:19,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1515075748, now seen corresponding path program 1 times [2023-11-29 06:41:19,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:19,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209272238] [2023-11-29 06:41:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:19,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:20,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:20,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209272238] [2023-11-29 06:41:20,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209272238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:20,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:20,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:41:20,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302271477] [2023-11-29 06:41:20,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:20,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:41:20,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:20,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:41:20,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:41:20,074 INFO L87 Difference]: Start difference. First operand 124 states and 148 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:20,185 INFO L93 Difference]: Finished difference Result 143 states and 169 transitions. [2023-11-29 06:41:20,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:41:20,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 06:41:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:20,187 INFO L225 Difference]: With dead ends: 143 [2023-11-29 06:41:20,187 INFO L226 Difference]: Without dead ends: 143 [2023-11-29 06:41:20,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:20,188 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:20,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 105 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-29 06:41:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2023-11-29 06:41:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.4201680672268908) internal successors, (169), 134 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2023-11-29 06:41:20,191 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 21 [2023-11-29 06:41:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:20,192 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2023-11-29 06:41:20,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2023-11-29 06:41:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 06:41:20,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:20,193 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:20,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 06:41:20,194 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:20,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:20,194 INFO L85 PathProgramCache]: Analyzing trace with hash 189870671, now seen corresponding path program 1 times [2023-11-29 06:41:20,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:20,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170924005] [2023-11-29 06:41:20,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:20,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:20,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170924005] [2023-11-29 06:41:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170924005] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094212875] [2023-11-29 06:41:20,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:20,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:20,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:20,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:20,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:41:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:20,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 06:41:20,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:20,697 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 06:41:20,703 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 06:41:20,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 06:41:20,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:41:20,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:41:20,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 06:41:20,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:41:20,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:41:20,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2023-11-29 06:41:20,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 06:41:20,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:41:20,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2023-11-29 06:41:20,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:41:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:21,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:21,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094212875] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:21,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:41:21,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 5] total 12 [2023-11-29 06:41:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828542951] [2023-11-29 06:41:21,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:21,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 06:41:21,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:21,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 06:41:21,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:41:21,323 INFO L87 Difference]: Start difference. First operand 135 states and 169 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:21,727 INFO L93 Difference]: Finished difference Result 160 states and 193 transitions. [2023-11-29 06:41:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 06:41:21,728 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-29 06:41:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:21,729 INFO L225 Difference]: With dead ends: 160 [2023-11-29 06:41:21,729 INFO L226 Difference]: Without dead ends: 160 [2023-11-29 06:41:21,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2023-11-29 06:41:21,731 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 185 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:21,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 162 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-29 06:41:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 139. [2023-11-29 06:41:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 138 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 173 transitions. [2023-11-29 06:41:21,736 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 173 transitions. Word has length 24 [2023-11-29 06:41:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:21,737 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 173 transitions. [2023-11-29 06:41:21,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 173 transitions. [2023-11-29 06:41:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 06:41:21,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:21,738 INFO L195 NwaCegarLoop]: trace histogram [2, 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 06:41:21,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:41:21,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 06:41:21,940 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:21,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1591022905, now seen corresponding path program 1 times [2023-11-29 06:41:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:21,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385193764] [2023-11-29 06:41:21,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:21,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:22,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:22,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385193764] [2023-11-29 06:41:22,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385193764] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:22,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52368222] [2023-11-29 06:41:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:22,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:22,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:22,055 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:22,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:41:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:22,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 06:41:22,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:22,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 06:41:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:22,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:22,314 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_47| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_47|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_47| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-11-29 06:41:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 06:41:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52368222] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:22,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:41:22,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 6 [2023-11-29 06:41:22,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562618057] [2023-11-29 06:41:22,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:22,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:41:22,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:22,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:41:22,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-11-29 06:41:22,324 INFO L87 Difference]: Start difference. First operand 139 states and 173 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:22,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:22,495 INFO L93 Difference]: Finished difference Result 141 states and 174 transitions. [2023-11-29 06:41:22,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:41:22,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 06:41:22,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:22,497 INFO L225 Difference]: With dead ends: 141 [2023-11-29 06:41:22,497 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 06:41:22,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2023-11-29 06:41:22,498 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:22,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 143 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2023-11-29 06:41:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 06:41:22,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-11-29 06:41:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 115 states have (on average 1.4260869565217391) internal successors, (164), 130 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2023-11-29 06:41:22,502 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 25 [2023-11-29 06:41:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:22,503 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2023-11-29 06:41:22,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2023-11-29 06:41:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 06:41:22,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:22,504 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 06:41:22,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:41:22,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:22,705 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:22,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:22,705 INFO L85 PathProgramCache]: Analyzing trace with hash 498453847, now seen corresponding path program 1 times [2023-11-29 06:41:22,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:22,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349519678] [2023-11-29 06:41:22,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:22,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:22,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349519678] [2023-11-29 06:41:22,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349519678] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:22,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28992263] [2023-11-29 06:41:22,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:22,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:22,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:22,837 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:22,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:41:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:22,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 06:41:22,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:22,993 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 06:41:23,038 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 06:41:23,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 06:41:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:23,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:23,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28992263] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:23,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:41:23,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-11-29 06:41:23,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546816514] [2023-11-29 06:41:23,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:23,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:41:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:23,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:41:23,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:23,198 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:23,341 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2023-11-29 06:41:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:41:23,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 06:41:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:23,342 INFO L225 Difference]: With dead ends: 149 [2023-11-29 06:41:23,343 INFO L226 Difference]: Without dead ends: 149 [2023-11-29 06:41:23,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:41:23,343 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 77 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:23,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 113 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-29 06:41:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 130. [2023-11-29 06:41:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 129 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2023-11-29 06:41:23,349 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 25 [2023-11-29 06:41:23,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:23,349 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2023-11-29 06:41:23,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2023-11-29 06:41:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 06:41:23,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:23,350 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 06:41:23,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 06:41:23,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:23,551 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:23,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash 498453848, now seen corresponding path program 1 times [2023-11-29 06:41:23,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:23,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081788857] [2023-11-29 06:41:23,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:23,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:23,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:23,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081788857] [2023-11-29 06:41:23,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081788857] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:23,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147325299] [2023-11-29 06:41:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:23,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:23,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:23,776 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:23,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 06:41:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:23,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 06:41:23,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:23,932 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 06:41:24,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:24,060 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 16 treesize of output 11 [2023-11-29 06:41:24,068 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:41:24,068 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 06:41:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:24,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:24,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2023-11-29 06:41:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:24,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147325299] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:24,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:41:24,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-29 06:41:24,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408588542] [2023-11-29 06:41:24,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:24,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:41:24,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:24,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:41:24,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:41:24,453 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:24,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:24,673 INFO L93 Difference]: Finished difference Result 148 states and 179 transitions. [2023-11-29 06:41:24,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:41:24,674 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 06:41:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:24,675 INFO L225 Difference]: With dead ends: 148 [2023-11-29 06:41:24,675 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 06:41:24,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:41:24,676 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 169 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:24,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 133 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:41:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 06:41:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2023-11-29 06:41:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 115 states have (on average 1.391304347826087) internal successors, (160), 128 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2023-11-29 06:41:24,681 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 25 [2023-11-29 06:41:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:24,681 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2023-11-29 06:41:24,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2023-11-29 06:41:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 06:41:24,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:24,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:24,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 06:41:24,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:24,883 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:24,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2005332582, now seen corresponding path program 1 times [2023-11-29 06:41:24,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:24,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455616202] [2023-11-29 06:41:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:24,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:25,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:25,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455616202] [2023-11-29 06:41:25,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455616202] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:25,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378266708] [2023-11-29 06:41:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:25,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:25,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:25,123 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:25,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 06:41:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:25,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 06:41:25,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:25,305 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 06:41:25,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:41:25,348 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-29 06:41:25,348 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 06:41:25,418 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 06:41:25,418 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 06:41:25,459 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 06:41:25,460 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 36 treesize of output 16 [2023-11-29 06:41:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:25,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:25,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378266708] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:25,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:41:25,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-29 06:41:25,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297124475] [2023-11-29 06:41:25,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:25,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:41:25,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:25,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:41:25,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:41:25,594 INFO L87 Difference]: Start difference. First operand 129 states and 160 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:25,966 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2023-11-29 06:41:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:41:25,967 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 06:41:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:25,968 INFO L225 Difference]: With dead ends: 128 [2023-11-29 06:41:25,968 INFO L226 Difference]: Without dead ends: 128 [2023-11-29 06:41:25,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2023-11-29 06:41:25,969 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:25,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 229 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:41:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-29 06:41:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-11-29 06:41:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 115 states have (on average 1.373913043478261) internal successors, (158), 127 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2023-11-29 06:41:25,974 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 26 [2023-11-29 06:41:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:25,974 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2023-11-29 06:41:25,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2023-11-29 06:41:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 06:41:25,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:25,975 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:25,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 06:41:26,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:26,183 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:26,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2005332583, now seen corresponding path program 1 times [2023-11-29 06:41:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877211204] [2023-11-29 06:41:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:26,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:26,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877211204] [2023-11-29 06:41:26,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877211204] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:26,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245652226] [2023-11-29 06:41:26,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:26,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:26,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:26,622 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:26,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 06:41:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:26,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 06:41:26,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:26,803 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 06:41:26,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:41:26,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:41:26,917 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 06:41:26,917 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 06:41:26,933 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 06:41:27,040 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 06:41:27,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2023-11-29 06:41:27,059 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 06:41:27,059 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 1 case distinctions, treesize of input 38 treesize of output 29 [2023-11-29 06:41:27,134 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 06:41:27,134 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 41 treesize of output 21 [2023-11-29 06:41:27,142 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 06:41:27,143 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 38 treesize of output 18 [2023-11-29 06:41:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:27,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:27,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2023-11-29 06:41:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:27,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245652226] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:27,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:41:27,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2023-11-29 06:41:27,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852883907] [2023-11-29 06:41:27,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:27,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 06:41:27,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:27,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 06:41:27,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2023-11-29 06:41:27,544 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 21 states, 20 states have (on average 2.9) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:28,351 INFO L93 Difference]: Finished difference Result 136 states and 165 transitions. [2023-11-29 06:41:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:41:28,351 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.9) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 06:41:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:28,352 INFO L225 Difference]: With dead ends: 136 [2023-11-29 06:41:28,353 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 06:41:28,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2023-11-29 06:41:28,354 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:28,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 392 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:41:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 06:41:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 115. [2023-11-29 06:41:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 114 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2023-11-29 06:41:28,358 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 26 [2023-11-29 06:41:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:28,359 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2023-11-29 06:41:28,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.9) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2023-11-29 06:41:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 06:41:28,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:28,360 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 06:41:28,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 06:41:28,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 06:41:28,567 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:28,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:28,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1180929952, now seen corresponding path program 1 times [2023-11-29 06:41:28,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:28,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879749146] [2023-11-29 06:41:28,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:28,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:28,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:28,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879749146] [2023-11-29 06:41:28,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879749146] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:28,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575509372] [2023-11-29 06:41:28,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:28,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:28,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:28,710 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:28,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 06:41:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:28,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 06:41:28,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:28,896 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 06:41:28,948 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 06:41:28,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 06:41:29,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:41:29,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:41:29,055 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 06:41:29,065 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 06:41:29,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-11-29 06:41:29,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 06:41:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:29,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:29,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2023-11-29 06:41:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575509372] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:29,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:41:29,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 5] total 17 [2023-11-29 06:41:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666633744] [2023-11-29 06:41:29,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:29,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 06:41:29,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:29,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 06:41:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-11-29 06:41:29,547 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand has 18 states, 17 states have (on average 4.529411764705882) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:29,929 INFO L93 Difference]: Finished difference Result 148 states and 179 transitions. [2023-11-29 06:41:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:41:29,929 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.529411764705882) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 06:41:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:29,930 INFO L225 Difference]: With dead ends: 148 [2023-11-29 06:41:29,930 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 06:41:29,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2023-11-29 06:41:29,932 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 44 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:29,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 167 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:41:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 06:41:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 131. [2023-11-29 06:41:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 119 states have (on average 1.3529411764705883) internal successors, (161), 130 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2023-11-29 06:41:29,936 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 27 [2023-11-29 06:41:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:29,936 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 161 transitions. [2023-11-29 06:41:29,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.529411764705882) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions. [2023-11-29 06:41:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 06:41:29,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:29,937 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 06:41:29,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 06:41:30,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-29 06:41:30,138 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:30,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:30,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2045875586, now seen corresponding path program 1 times [2023-11-29 06:41:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:30,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021588889] [2023-11-29 06:41:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:30,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 06:41:30,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:30,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021588889] [2023-11-29 06:41:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021588889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:30,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:30,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:41:30,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356508620] [2023-11-29 06:41:30,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:30,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:41:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:30,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:41:30,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:41:30,298 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:30,406 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2023-11-29 06:41:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:41:30,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 06:41:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:30,408 INFO L225 Difference]: With dead ends: 140 [2023-11-29 06:41:30,408 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 06:41:30,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:30,409 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:30,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 78 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 06:41:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 106. [2023-11-29 06:41:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 105 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2023-11-29 06:41:30,413 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 28 [2023-11-29 06:41:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:30,413 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2023-11-29 06:41:30,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2023-11-29 06:41:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 06:41:30,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:30,414 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 06:41:30,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 06:41:30,414 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:30,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:30,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1008630477, now seen corresponding path program 1 times [2023-11-29 06:41:30,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:30,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362279149] [2023-11-29 06:41:30,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:30,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:30,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:30,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362279149] [2023-11-29 06:41:30,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362279149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:30,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:30,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:41:30,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732157175] [2023-11-29 06:41:30,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:30,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:41:30,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:30,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:41:30,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:30,593 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:30,785 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2023-11-29 06:41:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:41:30,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 06:41:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:30,787 INFO L225 Difference]: With dead ends: 126 [2023-11-29 06:41:30,787 INFO L226 Difference]: Without dead ends: 126 [2023-11-29 06:41:30,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:41:30,788 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:30,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 110 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:41:30,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-29 06:41:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2023-11-29 06:41:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 113 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2023-11-29 06:41:30,792 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 30 [2023-11-29 06:41:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:30,792 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2023-11-29 06:41:30,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2023-11-29 06:41:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 06:41:30,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:30,793 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 06:41:30,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 06:41:30,794 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:30,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1008630478, now seen corresponding path program 1 times [2023-11-29 06:41:30,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:30,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951125504] [2023-11-29 06:41:30,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:31,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:31,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951125504] [2023-11-29 06:41:31,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951125504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:31,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:31,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:41:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276648912] [2023-11-29 06:41:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:31,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:41:31,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:31,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:41:31,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:31,092 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:31,316 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2023-11-29 06:41:31,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:41:31,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 06:41:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:31,318 INFO L225 Difference]: With dead ends: 141 [2023-11-29 06:41:31,318 INFO L226 Difference]: Without dead ends: 141 [2023-11-29 06:41:31,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:41:31,319 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:31,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 153 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:41:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-29 06:41:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2023-11-29 06:41:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 113 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2023-11-29 06:41:31,323 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 30 [2023-11-29 06:41:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:31,323 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2023-11-29 06:41:31,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2023-11-29 06:41:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 06:41:31,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:31,324 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 06:41:31,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 06:41:31,324 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:31,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1202774676, now seen corresponding path program 1 times [2023-11-29 06:41:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:31,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404500248] [2023-11-29 06:41:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:31,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404500248] [2023-11-29 06:41:31,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404500248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:31,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:31,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:41:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113189336] [2023-11-29 06:41:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:31,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:41:31,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:31,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:41:31,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:41:31,499 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:31,704 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2023-11-29 06:41:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:41:31,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 06:41:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:31,706 INFO L225 Difference]: With dead ends: 146 [2023-11-29 06:41:31,706 INFO L226 Difference]: Without dead ends: 146 [2023-11-29 06:41:31,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:41:31,707 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 46 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:31,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 231 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:41:31,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-29 06:41:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2023-11-29 06:41:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 114 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2023-11-29 06:41:31,711 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 31 [2023-11-29 06:41:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:31,711 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2023-11-29 06:41:31,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2023-11-29 06:41:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 06:41:31,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:31,712 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 06:41:31,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 06:41:31,712 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:31,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1368690551, now seen corresponding path program 1 times [2023-11-29 06:41:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:31,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592166956] [2023-11-29 06:41:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:31,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:31,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:31,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592166956] [2023-11-29 06:41:31,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592166956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:31,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:31,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:41:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094008974] [2023-11-29 06:41:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:31,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:41:31,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:41:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:41:31,922 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:32,171 INFO L93 Difference]: Finished difference Result 145 states and 167 transitions. [2023-11-29 06:41:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:41:32,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 06:41:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:32,172 INFO L225 Difference]: With dead ends: 145 [2023-11-29 06:41:32,173 INFO L226 Difference]: Without dead ends: 145 [2023-11-29 06:41:32,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:41:32,173 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 37 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:32,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 197 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:41:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-29 06:41:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2023-11-29 06:41:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 115 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 136 transitions. [2023-11-29 06:41:32,177 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 136 transitions. Word has length 32 [2023-11-29 06:41:32,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:32,177 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 136 transitions. [2023-11-29 06:41:32,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 136 transitions. [2023-11-29 06:41:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 06:41:32,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:32,178 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 06:41:32,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 06:41:32,178 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:32,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:32,179 INFO L85 PathProgramCache]: Analyzing trace with hash 520266038, now seen corresponding path program 1 times [2023-11-29 06:41:32,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:32,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194184948] [2023-11-29 06:41:32,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:32,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:41:32,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:32,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194184948] [2023-11-29 06:41:32,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194184948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:32,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:32,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:41:32,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562067396] [2023-11-29 06:41:32,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:32,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:41:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:41:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:41:32,251 INFO L87 Difference]: Start difference. First operand 116 states and 136 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:32,313 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2023-11-29 06:41:32,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:41:32,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-29 06:41:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:32,314 INFO L225 Difference]: With dead ends: 115 [2023-11-29 06:41:32,315 INFO L226 Difference]: Without dead ends: 115 [2023-11-29 06:41:32,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 06:41:32,315 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:32,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 76 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:41:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-29 06:41:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-29 06:41:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 114 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2023-11-29 06:41:32,319 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 33 [2023-11-29 06:41:32,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:32,319 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2023-11-29 06:41:32,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2023-11-29 06:41:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 06:41:32,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:32,320 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:32,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 06:41:32,321 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:41:32,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:32,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1712859119, now seen corresponding path program 1 times [2023-11-29 06:41:32,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:32,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658156050] [2023-11-29 06:41:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:32,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:33,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:33,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658156050] [2023-11-29 06:41:33,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658156050] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:33,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876468133] [2023-11-29 06:41:33,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:33,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:33,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:33,211 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:33,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 06:41:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:33,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 06:41:33,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:33,366 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 06:41:33,381 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 06:41:33,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 06:41:33,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:41:33,527 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:41:33,527 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 06:41:33,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 06:41:33,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 06:41:33,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 06:41:33,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 06:41:33,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 06:41:33,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:33,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:33,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 06:41:33,794 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:41:33,794 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 45 treesize of output 42 [2023-11-29 06:41:34,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:34,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:34,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-29 06:41:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:34,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:34,067 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-11-29 06:41:34,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 06:41:34,131 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1804 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1804) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) is different from false [2023-11-29 06:41:34,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:41:34,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-11-29 06:41:34,650 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 46 treesize of output 42 [2023-11-29 06:41:34,654 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:41:34,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 06:41:34,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:41:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:34,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876468133] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:34,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:41:34,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 30 [2023-11-29 06:41:34,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161826679] [2023-11-29 06:41:34,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:34,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 06:41:34,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:34,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 06:41:34,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=707, Unknown=7, NotChecked=54, Total=870 [2023-11-29 06:41:34,702 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand has 30 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 30 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:39,861 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 06:41:43,900 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 06:41:47,933 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 06:41:52,013 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 06:41:56,102 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 06:42:00,124 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 06:42:01,475 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= (select .cse0 4) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse0 0) |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1804 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1802) |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1804) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) 0) 0) (forall ((v_ArrVal_1804 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1804) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0))) is different from false [2023-11-29 06:42:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:01,658 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2023-11-29 06:42:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 06:42:01,658 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 30 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 06:42:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:01,659 INFO L225 Difference]: With dead ends: 184 [2023-11-29 06:42:01,660 INFO L226 Difference]: Without dead ends: 184 [2023-11-29 06:42:01,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=408, Invalid=2116, Unknown=34, NotChecked=198, Total=2756 [2023-11-29 06:42:01,661 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 141 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 49 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:01,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 466 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 947 Invalid, 34 Unknown, 138 Unchecked, 25.8s Time] [2023-11-29 06:42:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-11-29 06:42:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 152. [2023-11-29 06:42:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 151 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2023-11-29 06:42:01,665 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 34 [2023-11-29 06:42:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:01,665 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2023-11-29 06:42:01,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 30 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:01,665 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2023-11-29 06:42:01,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 06:42:01,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:01,666 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 06:42:01,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 06:42:01,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-29 06:42:01,868 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:42:01,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:01,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1121472032, now seen corresponding path program 1 times [2023-11-29 06:42:01,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:01,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482135102] [2023-11-29 06:42:01,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:01,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:02,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:02,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482135102] [2023-11-29 06:42:02,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482135102] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:02,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969952150] [2023-11-29 06:42:02,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:02,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:02,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:02,030 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:42:02,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 06:42:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:02,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 06:42:02,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:02,198 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 06:42:02,238 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:42:02,238 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 06:42:02,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:42:02,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:42:02,313 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 16 treesize of output 16 [2023-11-29 06:42:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:02,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:42:02,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-11-29 06:42:02,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-29 06:42:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:02,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969952150] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:42:02,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:42:02,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2023-11-29 06:42:02,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556626861] [2023-11-29 06:42:02,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:42:02,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 06:42:02,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:02,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 06:42:02,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:42:02,509 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:02,908 INFO L93 Difference]: Finished difference Result 189 states and 215 transitions. [2023-11-29 06:42:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:42:02,909 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 06:42:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:02,910 INFO L225 Difference]: With dead ends: 189 [2023-11-29 06:42:02,910 INFO L226 Difference]: Without dead ends: 189 [2023-11-29 06:42:02,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2023-11-29 06:42:02,911 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 78 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:02,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 318 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:42:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-29 06:42:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 152. [2023-11-29 06:42:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 141 states have (on average 1.24822695035461) internal successors, (176), 151 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2023-11-29 06:42:02,915 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 34 [2023-11-29 06:42:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:02,915 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2023-11-29 06:42:02,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2023-11-29 06:42:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 06:42:02,915 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:02,916 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 06:42:02,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 06:42:03,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-11-29 06:42:03,117 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:42:03,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:03,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1759460953, now seen corresponding path program 1 times [2023-11-29 06:42:03,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:03,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762363742] [2023-11-29 06:42:03,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:03,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:03,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:03,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762363742] [2023-11-29 06:42:03,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762363742] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:03,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669508520] [2023-11-29 06:42:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:03,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:03,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:03,876 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:42:03,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 06:42:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:04,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 06:42:04,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:04,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 11 treesize of output 7 [2023-11-29 06:42:04,055 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 06:42:04,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 06:42:04,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:42:04,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:42:04,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:42:04,216 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:42:04,217 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 30 treesize of output 28 [2023-11-29 06:42:04,233 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:42:04,234 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 19 treesize of output 18 [2023-11-29 06:42:04,356 INFO L349 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2023-11-29 06:42:04,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 61 [2023-11-29 06:42:04,381 INFO L349 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2023-11-29 06:42:04,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2023-11-29 06:42:04,403 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 13 treesize of output 9 [2023-11-29 06:42:04,421 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 21 treesize of output 15 [2023-11-29 06:42:04,468 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 30 [2023-11-29 06:42:04,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2023-11-29 06:42:04,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2023-11-29 06:42:04,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2023-11-29 06:42:04,593 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-29 06:42:04,593 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 58 treesize of output 57 [2023-11-29 06:42:04,608 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 06:42:04,609 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 32 treesize of output 35 [2023-11-29 06:42:05,052 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-11-29 06:42:05,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 65 [2023-11-29 06:42:05,082 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-11-29 06:42:05,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2023-11-29 06:42:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:05,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:42:05,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 06:42:05,799 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (forall ((v_ArrVal_2085 (Array Int Int))) (or (not (= v_ArrVal_2085 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 (select v_ArrVal_2085 .cse0)))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2085))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((v_ArrVal_2084 (Array Int Int))) (or (forall ((v_ArrVal_2087 (Array Int Int))) (or (not (= (select v_ArrVal_2087 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2084) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2087) |c_ULTIMATE.start_main_~y~0#1.base|) 0)))) (not (= v_ArrVal_2084 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 (select v_ArrVal_2084 .cse0)))))))) is different from false [2023-11-29 06:42:09,886 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (forall ((v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (or (not (= v_ArrVal_2084 (store (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 (select v_ArrVal_2084 .cse0)) .cse1 (select v_ArrVal_2084 .cse1)))) (not (= (select v_ArrVal_2087 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2084) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2087) |c_ULTIMATE.start_main_~y~0#1.base|) 0)))) (forall ((v_ArrVal_2085 (Array Int Int))) (or (not (= v_ArrVal_2085 (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 (select v_ArrVal_2085 .cse1)))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2085))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from false [2023-11-29 06:42:09,921 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2085 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2079))) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2085))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (store (store (select .cse1 |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 (select v_ArrVal_2085 .cse3)) v_ArrVal_2085))))) (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2080))) (or (not (= (store (store (select .cse4 |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 (select v_ArrVal_2084 .cse2)) .cse3 (select v_ArrVal_2084 .cse3)) v_ArrVal_2084)) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store .cse4 |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2084) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2087) |c_ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= (select v_ArrVal_2087 |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))))) is different from false [2023-11-29 06:42:09,950 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_2080))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2084) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2087) |c_ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= (select v_ArrVal_2087 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (not (= (store (store (select .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 (select v_ArrVal_2084 .cse1)) .cse2 (select v_ArrVal_2084 .cse2)) v_ArrVal_2084))))) (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2085 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_2079))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2085))) (store .cse4 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= v_ArrVal_2085 (store (store (select .cse5 |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2 (select v_ArrVal_2085 .cse2))))))))) is different from false [2023-11-29 06:42:10,887 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) (.cse0 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_2073 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2085 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 .cse3 v_ArrVal_2073)))) (or (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2079) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2085) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse1 .cse0 v_ArrVal_2079) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2085) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (store (store (select (store (store .cse1 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse0)) .cse0 v_ArrVal_2079) |ULTIMATE.start_main_~y~0#1.base|) 4 |c_ULTIMATE.start_main_~x~0#1.base|) 8 (select v_ArrVal_2085 8)) v_ArrVal_2085))))) (forall ((v_ArrVal_2075 Int) (v_ArrVal_2080 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (or (not (= v_ArrVal_2084 (store (store (select (store (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse5 .cse3 v_ArrVal_2075)))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) 0 (select .cse5 |c_ULTIMATE.start_main_~x~0#1.offset|))))) .cse0 v_ArrVal_2080) |ULTIMATE.start_main_~y~0#1.base|) 4 (select v_ArrVal_2084 4)) 8 (select v_ArrVal_2084 8)))) (not (= (select v_ArrVal_2087 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2080) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2084) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2087) |ULTIMATE.start_main_~y~0#1.base|) 0))))))) is different from false [2023-11-29 06:42:10,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) (.cse0 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_2073 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2085 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse2 .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_2073)))) (or (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2079) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2085) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse1 .cse0 v_ArrVal_2079) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2085) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (store (store (select (store (store .cse1 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse0)) .cse0 v_ArrVal_2079) |ULTIMATE.start_main_~y~0#1.base|) 4 |c_ULTIMATE.start_main_~x~0#1.base|) 8 (select v_ArrVal_2085 8)) v_ArrVal_2085))))) (forall ((v_ArrVal_2075 Int) (v_ArrVal_2080 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2070 Int) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (or (not (= v_ArrVal_2084 (store (store (select (store (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse6 .cse3 v_ArrVal_2070) .cse4 v_ArrVal_2075)))) (store .cse5 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse5 |ULTIMATE.start_main_~y~0#1.base|) 0 (select .cse6 |c_ULTIMATE.start_main_~x~0#1.offset|))))) .cse0 v_ArrVal_2080) |ULTIMATE.start_main_~y~0#1.base|) 4 (select v_ArrVal_2084 4)) 8 (select v_ArrVal_2084 8)))) (not (= (select v_ArrVal_2087 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2080) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2084) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2087) |ULTIMATE.start_main_~y~0#1.base|) 0))))))) is different from false [2023-11-29 06:42:10,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:42:10,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 142 [2023-11-29 06:42:10,969 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:42:10,970 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 49 treesize of output 39 [2023-11-29 06:42:10,981 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:42:10,982 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 66 treesize of output 60 [2023-11-29 06:42:11,056 INFO L349 Elim1Store]: treesize reduction 122, result has 28.7 percent of original size [2023-11-29 06:42:11,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 83 [2023-11-29 06:42:11,075 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:42:11,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:42:11,100 INFO L349 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2023-11-29 06:42:11,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 57 [2023-11-29 06:42:11,113 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 16 treesize of output 12 [2023-11-29 06:42:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:11,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669508520] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:42:11,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:42:11,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 20] total 45 [2023-11-29 06:42:11,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351644225] [2023-11-29 06:42:11,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:42:11,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-29 06:42:11,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:11,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 06:42:11,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1205, Unknown=117, NotChecked=474, Total=1980 [2023-11-29 06:42:11,125 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand has 45 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 45 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:30,297 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2023-11-29 06:42:30,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 06:42:30,297 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 45 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-11-29 06:42:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:30,298 INFO L225 Difference]: With dead ends: 209 [2023-11-29 06:42:30,298 INFO L226 Difference]: Without dead ends: 209 [2023-11-29 06:42:30,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=330, Invalid=2290, Unknown=160, NotChecked=642, Total=3422 [2023-11-29 06:42:30,300 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 104 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 485 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:30,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 567 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 882 Invalid, 0 Unknown, 485 Unchecked, 1.3s Time] [2023-11-29 06:42:30,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-29 06:42:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 175. [2023-11-29 06:42:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 164 states have (on average 1.225609756097561) internal successors, (201), 174 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2023-11-29 06:42:30,303 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 35 [2023-11-29 06:42:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:30,303 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2023-11-29 06:42:30,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 45 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2023-11-29 06:42:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 06:42:30,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:30,303 INFO L195 NwaCegarLoop]: trace histogram [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 06:42:30,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-29 06:42:30,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-29 06:42:30,504 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:42:30,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:30,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1375181527, now seen corresponding path program 1 times [2023-11-29 06:42:30,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:30,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276780124] [2023-11-29 06:42:30,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:30,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:30,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:30,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276780124] [2023-11-29 06:42:30,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276780124] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:30,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098939546] [2023-11-29 06:42:30,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:30,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:30,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:30,779 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:42:30,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 06:42:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:30,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 06:42:30,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:30,940 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 7 treesize of output 3 [2023-11-29 06:42:31,100 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:42:31,100 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 06:42:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:42:31,147 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:42:31,345 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:42:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:42:31,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098939546] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:42:31,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:42:31,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 18 [2023-11-29 06:42:31,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045549029] [2023-11-29 06:42:31,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:42:31,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 06:42:31,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:31,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 06:42:31,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-11-29 06:42:31,348 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:32,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:32,267 INFO L93 Difference]: Finished difference Result 203 states and 232 transitions. [2023-11-29 06:42:32,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 06:42:32,268 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-29 06:42:32,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:32,269 INFO L225 Difference]: With dead ends: 203 [2023-11-29 06:42:32,269 INFO L226 Difference]: Without dead ends: 203 [2023-11-29 06:42:32,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=1012, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 06:42:32,270 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 115 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:32,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 117 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:42:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-29 06:42:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 166. [2023-11-29 06:42:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 156 states have (on average 1.205128205128205) internal successors, (188), 165 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:32,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 188 transitions. [2023-11-29 06:42:32,274 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 188 transitions. Word has length 37 [2023-11-29 06:42:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:32,274 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 188 transitions. [2023-11-29 06:42:32,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2023-11-29 06:42:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 06:42:32,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:32,275 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:32,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 06:42:32,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:32,476 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:42:32,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:32,476 INFO L85 PathProgramCache]: Analyzing trace with hash 817417508, now seen corresponding path program 1 times [2023-11-29 06:42:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:32,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79465052] [2023-11-29 06:42:32,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:32,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:32,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:32,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79465052] [2023-11-29 06:42:32,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79465052] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:32,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199125368] [2023-11-29 06:42:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:32,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:32,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:32,923 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:42:32,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 06:42:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:33,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 06:42:33,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:33,137 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 06:42:33,271 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 06:42:33,271 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 06:42:33,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:42:33,574 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:42:33,574 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 34 treesize of output 33 [2023-11-29 06:42:33,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 06:42:33,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 12 [2023-11-29 06:42:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:33,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:42:33,986 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_2376 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2376) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)) 1)) (forall ((v_ArrVal_2376 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2376) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) |c_ULTIMATE.start_main_~first~0#1.base|))))) is different from false [2023-11-29 06:42:33,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:42:33,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-11-29 06:42:34,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:42:34,011 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 39 treesize of output 38 [2023-11-29 06:42:34,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-29 06:42:34,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:42:34,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-11-29 06:42:34,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:42:34,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:34,049 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 22 treesize of output 10 [2023-11-29 06:42:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:34,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199125368] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:42:34,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:42:34,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2023-11-29 06:42:34,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175701826] [2023-11-29 06:42:34,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:42:34,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 06:42:34,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:34,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 06:42:34,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2023-11-29 06:42:34,349 INFO L87 Difference]: Start difference. First operand 166 states and 188 transitions. Second operand has 22 states, 21 states have (on average 4.380952380952381) internal successors, (92), 22 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:35,005 INFO L93 Difference]: Finished difference Result 225 states and 252 transitions. [2023-11-29 06:42:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:42:35,006 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.380952380952381) internal successors, (92), 22 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-11-29 06:42:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:35,007 INFO L225 Difference]: With dead ends: 225 [2023-11-29 06:42:35,007 INFO L226 Difference]: Without dead ends: 225 [2023-11-29 06:42:35,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=556, Unknown=1, NotChecked=50, Total=756 [2023-11-29 06:42:35,008 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 91 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:35,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 235 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 414 Invalid, 0 Unknown, 109 Unchecked, 0.5s Time] [2023-11-29 06:42:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-29 06:42:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 208. [2023-11-29 06:42:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 198 states have (on average 1.202020202020202) internal successors, (238), 207 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 238 transitions. [2023-11-29 06:42:35,014 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 238 transitions. Word has length 38 [2023-11-29 06:42:35,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:35,014 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 238 transitions. [2023-11-29 06:42:35,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.380952380952381) internal successors, (92), 22 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:35,014 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 238 transitions. [2023-11-29 06:42:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 06:42:35,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:35,015 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:35,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 06:42:35,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:35,216 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:42:35,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:35,216 INFO L85 PathProgramCache]: Analyzing trace with hash 817417509, now seen corresponding path program 1 times [2023-11-29 06:42:35,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:35,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341865744] [2023-11-29 06:42:35,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:35,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:36,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:36,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341865744] [2023-11-29 06:42:36,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341865744] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:36,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410762402] [2023-11-29 06:42:36,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:36,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:36,297 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:42:36,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 06:42:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:36,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 06:42:36,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:36,501 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 06:42:36,543 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 06:42:36,551 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 06:42:36,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:42:36,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:42:36,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 06:42:36,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 06:42:36,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 06:42:36,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:42:36,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:42:36,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-29 06:42:37,049 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:42:37,050 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 06:42:37,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:42:37,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 06:42:37,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:42:37,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 06:42:37,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:42:37,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 06:42:37,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 06:42:37,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:42:37,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 06:42:37,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:42:37,735 INFO L349 Elim1Store]: treesize reduction 40, result has 48.7 percent of original size [2023-11-29 06:42:37,736 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 3 case distinctions, treesize of input 35 treesize of output 56 [2023-11-29 06:42:37,784 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 06:42:37,784 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 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 06:42:38,069 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 105 treesize of output 82 [2023-11-29 06:42:38,079 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 119 treesize of output 108 [2023-11-29 06:42:38,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:42:38,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 111 [2023-11-29 06:42:38,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:42:38,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 104 [2023-11-29 06:42:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:39,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:42:39,756 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (or (forall ((v_ArrVal_2563 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 12))) (forall ((v_ArrVal_2564 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 0))) (forall ((v_ArrVal_2564 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0))) (or (forall ((v_ArrVal_2563 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 16) (select |c_#length| .cse1))) (= .cse1 0)))) (forall ((v_ArrVal_2563 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 13))) (forall ((v_ArrVal_2563 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0))) (or (= .cse2 0) (forall ((v_ArrVal_2564 (Array Int Int))) (<= (+ .cse2 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0))))))))) is different from false [2023-11-29 06:42:45,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:42:45,077 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 243 treesize of output 305 [2023-11-29 06:45:17,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:45:17,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:45:17,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 82 [2023-11-29 06:45:17,959 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 60 treesize of output 54 [2023-11-29 06:45:17,967 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 36 treesize of output 26 [2023-11-29 06:45:17,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 06:45:17,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 06:45:17,986 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:45:17,990 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 06:45:17,995 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:45:18,007 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-29 06:45:18,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 1 [2023-11-29 06:45:18,011 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:45:18,018 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-29 06:45:18,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 1 [2023-11-29 06:45:18,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:45:18,032 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-29 06:45:18,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 136 treesize of output 1 [2023-11-29 06:45:18,040 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:45:18,061 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-29 06:45:18,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 1 [2023-11-29 06:45:18,066 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:45:18,070 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 06:45:18,074 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:45:18,081 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-29 06:45:18,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 1 [2023-11-29 06:45:18,086 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:45:18,096 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-29 06:45:18,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 223 treesize of output 1 [2023-11-29 06:45:18,102 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:45:18,105 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 06:45:18,118 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:45:18,146 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-29 06:45:18,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 1 [2023-11-29 06:45:18,151 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:45:18,160 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-29 06:45:18,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 178 treesize of output 1 [2023-11-29 06:45:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:45:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410762402] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:45:19,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:45:19,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 36 [2023-11-29 06:45:19,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230803319] [2023-11-29 06:45:19,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:45:19,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 06:45:19,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:45:19,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 06:45:19,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1079, Unknown=38, NotChecked=68, Total=1332 [2023-11-29 06:45:19,405 INFO L87 Difference]: Start difference. First operand 208 states and 238 transitions. Second operand has 37 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 37 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:45:23,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:45:32,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 06:45:34,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 06:45:41,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 06:45:43,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 06:45:47,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 06:45:51,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 06:45:53,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 06:45:58,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:46:02,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:46:07,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:46:12,750 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse41 (select |c_#length| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~first~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 5)) (.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse21 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (= 20 .cse41)) (.cse38 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (let ((.cse0 (select .cse2 12))) (or (and (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) (= .cse0 0))) (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (forall ((v_ArrVal_2558 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2564 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_15 Int) (v_prenex_14 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse6 (+ v_prenex_15 12))) (or (forall ((v_prenex_13 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_13) |c_ULTIMATE.start_main_~last~0#1.base|) .cse6 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_17) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse4 0) (< .cse4 .cse5)))) (= .cse3 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_14) |c_ULTIMATE.start_main_~last~0#1.base|) .cse6 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_16) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7)))))))) (= (select .cse8 4) |c_ULTIMATE.start_main_~x~0#1.base|) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~first~0#1.base|))) (let ((.cse15 (select .cse14 0)) (.cse16 (select .cse14 12))) (let ((.cse12 (select .cse14 4)) (.cse10 (= .cse16 0)) (.cse11 (= .cse15 |c_ULTIMATE.start_main_~first~0#1.base|))) (or (and (= (select .cse9 4) 0) .cse10 .cse11 (= .cse12 |c_ULTIMATE.start_main_~x~0#1.base|)) (and (= .cse12 |c_ULTIMATE.start_main_~first~0#1.base|) (or (and (or (and (exists ((|ULTIMATE.start_main_~last~0#1.offset| Int)) (let ((.cse13 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (and (= 0 (select .cse9 .cse13)) (= (select .cse14 .cse13) |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse11) (= .cse15 |c_ULTIMATE.start_main_~x~0#1.base|)) .cse10) (and .cse11 (= .cse16 |c_ULTIMATE.start_main_~x~0#1.base|)))))))) (= (select .cse8 0) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse9 0) 0) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2564 (Array Int Int))) (let ((.cse18 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_main_~last~0#1.base|) .cse18 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse17 0) (forall ((v_ArrVal_2563 (Array Int Int))) (<= (+ 16 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2559) |c_ULTIMATE.start_main_~last~0#1.base|) .cse18 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7)) (select |c_#length| .cse17))))))) (forall ((v_ArrVal_2559 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2563 (Array Int Int))) (< 0 (+ 13 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2559) |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7)))) (or (forall ((v_ArrVal_2558 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2564 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_prenex_15 Int) (v_prenex_14 (Array Int Int)) (v_prenex_13 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse19 (+ v_prenex_15 12))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_14) |c_ULTIMATE.start_main_~last~0#1.base|) .cse19 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_16) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_13) |c_ULTIMATE.start_main_~last~0#1.base|) .cse19 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_17) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 0))))) (or (forall ((v_ArrVal_2563 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 12))) (forall ((v_ArrVal_2564 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 0))) (or (forall ((v_ArrVal_2558 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2564 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse20 0) (= .cse20 |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_prenex_15 Int) (v_prenex_14 (Array Int Int)) (v_prenex_16 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_14) |c_ULTIMATE.start_main_~last~0#1.base|) (+ v_prenex_15 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_16) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) |c_ULTIMATE.start_main_~x~0#1.base|))) (= (select .cse9 12) 0) (= (select .cse21 16) 0) (forall ((v_prenex_15 Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2564 (Array Int Int)) (v_prenex_14 (Array Int Int)) (v_ArrVal_2563 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse23 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_main_~last~0#1.base|) .cse23 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7)) (.cse22 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_14) |c_ULTIMATE.start_main_~last~0#1.base|) (+ v_prenex_15 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_16) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse22 |c_ULTIMATE.start_main_~x~0#1.base|) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2559) |c_ULTIMATE.start_main_~last~0#1.base|) .cse23 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) .cse5) (= .cse24 0) (= .cse24 .cse22))))) (<= (+ |c_ULTIMATE.start_main_~first~0#1.offset| 16) (select |c_#length| |c_ULTIMATE.start_main_~first~0#1.base|)) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2564 (Array Int Int)) (v_ArrVal_2563 (Array Int Int))) (let ((.cse25 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2559) |c_ULTIMATE.start_main_~last~0#1.base|) .cse25 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) .cse5) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_main_~last~0#1.base|) .cse25 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 0)))) (forall ((v_ArrVal_2564 (Array Int Int))) (let ((.cse26 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2563 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 16) (select |c_#length| .cse26))) (= .cse26 0)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse27 (+ v_prenex_10 12))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~last~0#1.base|) .cse27 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_12) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 13)) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_9) |c_ULTIMATE.start_main_~last~0#1.base|) .cse27 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_11) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 0)))) (= (select .cse21 0) 0) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~last~0#1.base|) (+ 12 v_prenex_6) |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_7) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 12))) (forall ((v_ArrVal_2558 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2564 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse28 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_15 Int) (v_prenex_14 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse30 (+ v_prenex_15 12))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_14) |c_ULTIMATE.start_main_~last~0#1.base|) .cse30 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_16) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse29 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse28 .cse29) (forall ((v_prenex_13 (Array Int Int)) (v_prenex_17 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_13) |c_ULTIMATE.start_main_~last~0#1.base|) .cse30 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_17) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 0))))))))) (not (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_2558 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2564 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (forall ((v_prenex_15 Int) (v_prenex_14 (Array Int Int)) (v_prenex_16 (Array Int Int))) (= .cse31 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_14) |c_ULTIMATE.start_main_~last~0#1.base|) (+ v_prenex_15 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_16) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (= .cse31 0) (= .cse31 |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_prenex_15 Int) (v_prenex_13 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_13) |c_ULTIMATE.start_main_~last~0#1.base|) (+ v_prenex_15 12) |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_17) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse32 0) (< .cse32 .cse5)))) (not (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_prenex_15 Int) (v_ArrVal_2558 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2564 (Array Int Int)) (v_prenex_14 (Array Int Int)) (v_prenex_13 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse34 (+ v_prenex_15 12))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_14) |c_ULTIMATE.start_main_~last~0#1.base|) .cse34 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_16) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse33 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) .cse33) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_13) |c_ULTIMATE.start_main_~last~0#1.base|) .cse34 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_17) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 0))))) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2563 (Array Int Int))) (let ((.cse36 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2559) |c_ULTIMATE.start_main_~last~0#1.base|) .cse36 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2564 (Array Int Int))) (<= (+ 16 .cse35) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_main_~last~0#1.base|) .cse36 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7)))) (= .cse35 0))))) (= |c_ULTIMATE.start_main_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~last~0#1.base|) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int)) (let ((.cse37 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (or (forall ((v_ArrVal_2563 (Array Int Int))) (<= 0 (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2559) |c_ULTIMATE.start_main_~last~0#1.base|) .cse37 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7)))) (forall ((v_ArrVal_2564 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_main_~last~0#1.base|) .cse37 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 0))))) (forall ((|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2563 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store .cse38 (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 13))) (forall ((v_ArrVal_2558 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2564 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse39 0) (= .cse39 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_15 Int) (v_prenex_14 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_14) |c_ULTIMATE.start_main_~last~0#1.base|) (+ v_prenex_15 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_16) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse40 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse39 .cse40))))))) (<= 20 .cse41) (forall ((v_ArrVal_2563 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 13))) (= (select .cse8 12) 0) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|) (= (select .cse21 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) 0) (<= 0 .cse7) (= (select .cse21 12) 0) (forall ((|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2563 (Array Int Int))) (let ((.cse43 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store .cse38 .cse43 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse42 0) (forall ((v_ArrVal_2564 (Array Int Int))) (<= (+ 16 .cse42) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store .cse2 .cse43 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7)))))))) (forall ((|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2564 (Array Int Int))) (let ((.cse45 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store .cse2 .cse45 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse44 0) (forall ((v_ArrVal_2563 (Array Int Int))) (<= (+ 16 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store .cse38 .cse45 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7)) (select |c_#length| .cse44))))))) .cse1 (forall ((v_ArrVal_2563 (Array Int Int))) (let ((.cse46 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))) (or (= .cse46 0) (forall ((v_ArrVal_2564 (Array Int Int))) (<= (+ .cse46 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7))))))) (forall ((|ULTIMATE.start_main_~last~0#1.offset| Int)) (let ((.cse47 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (or (forall ((v_ArrVal_2563 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store .cse38 .cse47 |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 12))) (forall ((v_ArrVal_2564 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store .cse2 .cse47 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2564) |c_ULTIMATE.start_main_~first~0#1.base|) .cse7) 0))))) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0)))) is different from true [2023-11-29 06:46:26,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:46:32,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 06:46:37,058 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, 1] [2023-11-29 06:46:42,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:46:44,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:46:48,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:46:55,084 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 06:47:02,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:47:12,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:47:23,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:47:35,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 06:47:41,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:47:45,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:47:50,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:47:55,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:47:59,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:04,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:08,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:13,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:15,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:20,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:27,575 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 06:48:30,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:35,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:39,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:41,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:48,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:49,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:52,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:48:57,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:49:01,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:49:03,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:49:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:49:03,524 INFO L93 Difference]: Finished difference Result 275 states and 310 transitions. [2023-11-29 06:49:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-29 06:49:03,525 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 37 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-11-29 06:49:03,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:49:03,527 INFO L225 Difference]: With dead ends: 275 [2023-11-29 06:49:03,527 INFO L226 Difference]: Without dead ends: 275 [2023-11-29 06:49:03,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 209.4s TimeCoverageRelationStatistics Valid=781, Invalid=4013, Unknown=44, NotChecked=274, Total=5112 [2023-11-29 06:49:03,529 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 186 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 69 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 164.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 169.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:49:03,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 802 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1422 Invalid, 19 Unknown, 208 Unchecked, 169.4s Time] [2023-11-29 06:49:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-11-29 06:49:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 230. [2023-11-29 06:49:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 220 states have (on average 1.2136363636363636) internal successors, (267), 229 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:49:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 267 transitions. [2023-11-29 06:49:03,534 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 267 transitions. Word has length 38 [2023-11-29 06:49:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:49:03,534 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 267 transitions. [2023-11-29 06:49:03,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 37 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:49:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 267 transitions. [2023-11-29 06:49:03,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 06:49:03,535 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:49:03,535 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:49:03,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 06:49:03,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:49:03,736 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:49:03,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:49:03,736 INFO L85 PathProgramCache]: Analyzing trace with hash -429861628, now seen corresponding path program 1 times [2023-11-29 06:49:03,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:49:03,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211492805] [2023-11-29 06:49:03,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:49:03,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:49:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:49:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:49:04,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:49:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211492805] [2023-11-29 06:49:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211492805] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:49:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401187261] [2023-11-29 06:49:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:49:04,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:49:04,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:49:04,059 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:49:04,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 06:49:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:49:04,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 06:49:04,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:49:04,243 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 06:49:04,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:49:04,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 06:49:04,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:49:04,618 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:49:04,618 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 33 treesize of output 32 [2023-11-29 06:49:04,693 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 06:49:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:49:04,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:49:04,770 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2721 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2721) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))))) is different from false [2023-11-29 06:49:04,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:49:04,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-11-29 06:49:04,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:49:04,793 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 39 treesize of output 38 [2023-11-29 06:49:04,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-29 06:49:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:49:05,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401187261] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:49:05,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:49:05,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2023-11-29 06:49:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571474919] [2023-11-29 06:49:05,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:49:05,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 06:49:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:49:05,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 06:49:05,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2023-11-29 06:49:05,223 INFO L87 Difference]: Start difference. First operand 230 states and 267 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:49:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:49:06,284 INFO L93 Difference]: Finished difference Result 238 states and 267 transitions. [2023-11-29 06:49:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:49:06,284 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-11-29 06:49:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:49:06,286 INFO L225 Difference]: With dead ends: 238 [2023-11-29 06:49:06,286 INFO L226 Difference]: Without dead ends: 238 [2023-11-29 06:49:06,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=419, Unknown=1, NotChecked=44, Total=600 [2023-11-29 06:49:06,287 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 148 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:49:06,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 396 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 449 Invalid, 0 Unknown, 103 Unchecked, 0.7s Time] [2023-11-29 06:49:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-11-29 06:49:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2023-11-29 06:49:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 220 states have (on average 1.2045454545454546) internal successors, (265), 229 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:49:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 265 transitions. [2023-11-29 06:49:06,291 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 265 transitions. Word has length 39 [2023-11-29 06:49:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:49:06,292 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 265 transitions. [2023-11-29 06:49:06,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:49:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 265 transitions. [2023-11-29 06:49:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 06:49:06,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:49:06,293 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:49:06,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 06:49:06,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:49:06,493 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:49:06,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:49:06,494 INFO L85 PathProgramCache]: Analyzing trace with hash -429859431, now seen corresponding path program 1 times [2023-11-29 06:49:06,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:49:06,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252735615] [2023-11-29 06:49:06,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:49:06,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:49:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:49:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:49:07,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:49:07,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252735615] [2023-11-29 06:49:07,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252735615] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:49:07,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699750975] [2023-11-29 06:49:07,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:49:07,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:49:07,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:49:07,251 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:49:07,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 06:49:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:49:07,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 06:49:07,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:49:07,437 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 06:49:07,553 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:49:07,554 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 06:49:07,732 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 06:49:07,774 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 06:49:07,815 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 7 treesize of output 3 [2023-11-29 06:49:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:49:07,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:49:07,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:49:07,975 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 06:49:08,161 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2879 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2879) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 1))) is different from false [2023-11-29 06:49:08,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:49:08,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-11-29 06:49:08,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:49:08,195 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 40 treesize of output 39 [2023-11-29 06:49:08,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 06:49:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:49:08,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699750975] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:49:08,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:49:08,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2023-11-29 06:49:08,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696691975] [2023-11-29 06:49:08,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:49:08,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 06:49:08,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:49:08,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 06:49:08,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=387, Unknown=1, NotChecked=40, Total=506 [2023-11-29 06:49:08,554 INFO L87 Difference]: Start difference. First operand 230 states and 265 transitions. Second operand has 23 states, 22 states have (on average 4.136363636363637) internal successors, (91), 23 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:49:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:49:10,193 INFO L93 Difference]: Finished difference Result 284 states and 324 transitions. [2023-11-29 06:49:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 06:49:10,193 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.136363636363637) internal successors, (91), 23 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-11-29 06:49:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:49:10,195 INFO L225 Difference]: With dead ends: 284 [2023-11-29 06:49:10,195 INFO L226 Difference]: Without dead ends: 284 [2023-11-29 06:49:10,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=212, Invalid=847, Unknown=1, NotChecked=62, Total=1122 [2023-11-29 06:49:10,196 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 237 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:49:10,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 368 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 804 Invalid, 0 Unknown, 139 Unchecked, 1.2s Time] [2023-11-29 06:49:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-11-29 06:49:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 264. [2023-11-29 06:49:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 254 states have (on average 1.2401574803149606) internal successors, (315), 263 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:49:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 315 transitions. [2023-11-29 06:49:10,202 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 315 transitions. Word has length 39 [2023-11-29 06:49:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:49:10,202 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 315 transitions. [2023-11-29 06:49:10,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.136363636363637) internal successors, (91), 23 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:49:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 315 transitions. [2023-11-29 06:49:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 06:49:10,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:49:10,204 INFO L195 NwaCegarLoop]: trace histogram [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 06:49:10,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-29 06:49:10,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-29 06:49:10,404 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-29 06:49:10,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:49:10,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1300483948, now seen corresponding path program 1 times [2023-11-29 06:49:10,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:49:10,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373490390] [2023-11-29 06:49:10,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:49:10,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:49:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:49:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:49:11,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:49:11,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373490390] [2023-11-29 06:49:11,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373490390] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:49:11,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166757477] [2023-11-29 06:49:11,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:49:11,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:49:11,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:49:11,988 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:49:11,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dd882e-ced5-4bb5-8ca3-bcbb110f2a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 06:49:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:49:12,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 06:49:12,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:49:12,219 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 06:49:12,228 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 06:49:12,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:49:12,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:49:12,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 06:49:12,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 06:49:12,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:49:12,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 06:49:12,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:49:12,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:49:12,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2023-11-29 06:49:12,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 06:49:12,679 INFO L349 Elim1Store]: treesize reduction 64, result has 31.9 percent of original size [2023-11-29 06:49:12,679 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 6 case distinctions, treesize of input 37 treesize of output 46 [2023-11-29 06:49:12,783 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2023-11-29 06:49:12,784 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 30 treesize of output 37 [2023-11-29 06:49:13,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:49:13,287 INFO L349 Elim1Store]: treesize reduction 106, result has 23.2 percent of original size [2023-11-29 06:49:13,287 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 84 [2023-11-29 06:49:13,443 INFO L349 Elim1Store]: treesize reduction 64, result has 45.8 percent of original size [2023-11-29 06:49:13,444 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 5 case distinctions, treesize of input 66 treesize of output 95 [2023-11-29 06:49:14,203 INFO L349 Elim1Store]: treesize reduction 74, result has 33.9 percent of original size [2023-11-29 06:49:14,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 246 [2023-11-29 06:49:14,312 INFO L349 Elim1Store]: treesize reduction 44, result has 51.6 percent of original size [2023-11-29 06:49:14,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 204 treesize of output 204 [2023-11-29 06:49:15,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 80 [2023-11-29 06:49:15,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:49:15,522 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 67 treesize of output 69 [2023-11-29 06:49:15,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:49:15,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:49:15,672 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 111 treesize of output 117 [2023-11-29 06:49:16,408 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-29 06:49:16,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:49:16,824 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-29 06:49:16,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 80 treesize of output 66 [2023-11-29 06:49:17,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:49:17,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 145 treesize of output 217 [2023-11-29 06:49:29,950 INFO L349 Elim1Store]: treesize reduction 16, result has 95.6 percent of original size [2023-11-29 06:49:29,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 3 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 42 case distinctions, treesize of input 415 treesize of output 643 [2023-11-29 06:51:13,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:51:13,036 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 06:51:13,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 57 treesize of output 39 [2023-11-29 06:51:13,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:51:13,132 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 06:51:13,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 57 treesize of output 39 [2023-11-29 06:51:13,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:51:13,191 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 06:51:13,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 57 treesize of output 39 [2023-11-29 06:51:13,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:51:13,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 205 treesize of output 249 [2023-11-29 06:51:23,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-29 06:51:23,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:51:23,114 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 148 treesize of output 124 [2023-11-29 06:51:23,296 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:51:23,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 82 [2023-11-29 06:51:23,437 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:51:23,437 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 147 treesize of output 119 [2023-11-29 06:51:23,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:51:23,512 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 103 treesize of output 87 [2023-11-29 06:51:23,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:51:23,666 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 113 treesize of output 89 [2023-11-29 06:51:23,809 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:51:23,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 82 [2023-11-29 06:51:28,065 INFO L349 Elim1Store]: treesize reduction 1676, result has 19.1 percent of original size [2023-11-29 06:51:28,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 119 case distinctions, treesize of input 1528 treesize of output 1576 [2023-11-29 06:51:33,466 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 559 DAG size of output: 513 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 06:51:33,467 INFO L349 Elim1Store]: treesize reduction 180, result has 84.4 percent of original size [2023-11-29 06:51:33,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 19 new quantified variables, introduced 120 case distinctions, treesize of input 1567 treesize of output 2234