./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/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_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/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_be03c969-edd9-4b7c-b2f2-7116f8c1a136/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 e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:27:42,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:27:43,013 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 01:27:43,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:27:43,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:27:43,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:27:43,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:27:43,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:27:43,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:27:43,045 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:27:43,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:27:43,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:27:43,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:27:43,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:27:43,048 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:27:43,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:27:43,049 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:27:43,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:27:43,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:27:43,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:27:43,051 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:27:43,051 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:27:43,052 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:27:43,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:27:43,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:27:43,053 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:27:43,053 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:27:43,053 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:27:43,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:27:43,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:27:43,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:27:43,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:27:43,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:27:43,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:27:43,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:27:43,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:27:43,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:27:43,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:27:43,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:27:43,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:27:43,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:27:43,058 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_be03c969-edd9-4b7c-b2f2-7116f8c1a136/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_be03c969-edd9-4b7c-b2f2-7116f8c1a136/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 -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2023-11-29 01:27:43,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:27:43,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:27:43,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:27:43,299 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:27:43,299 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:27:43,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2023-11-29 01:27:46,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:27:46,308 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:27:46,309 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2023-11-29 01:27:46,323 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/data/3d365fe27/5a2723cff8534785b7406b4e1c232bbf/FLAG1e6dc9934 [2023-11-29 01:27:46,336 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/data/3d365fe27/5a2723cff8534785b7406b4e1c232bbf [2023-11-29 01:27:46,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:27:46,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:27:46,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:27:46,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:27:46,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:27:46,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0288ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46, skipping insertion in model container [2023-11-29 01:27:46,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,387 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:27:46,631 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:27:46,640 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:27:46,681 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:27:46,709 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:27:46,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46 WrapperNode [2023-11-29 01:27:46,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:27:46,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:27:46,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:27:46,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:27:46,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,765 INFO L138 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 223 [2023-11-29 01:27:46,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:27:46,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:27:46,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:27:46,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:27:46,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,807 INFO L175 MemorySlicer]: Split 49 memory accesses to 2 slices as follows [2, 47]. 96 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2023-11-29 01:27:46,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:27:46,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:27:46,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:27:46,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:27:46,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (1/1) ... [2023-11-29 01:27:46,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:27:46,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:46,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:46,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:27:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:27:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:27:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:27:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:27:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:27:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:27:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:27:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:27:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:27:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:27:46,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:27:47,023 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:27:47,025 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:27:47,527 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:27:47,581 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:27:47,581 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-11-29 01:27:47,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:27:47 BoogieIcfgContainer [2023-11-29 01:27:47,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:27:47,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:27:47,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:27:47,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:27:47,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:27:46" (1/3) ... [2023-11-29 01:27:47,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44749361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:27:47, skipping insertion in model container [2023-11-29 01:27:47,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:46" (2/3) ... [2023-11-29 01:27:47,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44749361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:27:47, skipping insertion in model container [2023-11-29 01:27:47,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:27:47" (3/3) ... [2023-11-29 01:27:47,592 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2023-11-29 01:27:47,611 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:27:47,611 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2023-11-29 01:27:47,661 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:27:47,668 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;@5e052da5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:27:47,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-11-29 01:27:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 82 states have (on average 2.5609756097560976) internal successors, (210), 186 states have internal predecessors, (210), 0 states have call successors, (0), 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 01:27:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 01:27:47,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:47,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 01:27:47,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:47,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:47,686 INFO L85 PathProgramCache]: Analyzing trace with hash 11939, now seen corresponding path program 1 times [2023-11-29 01:27:47,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:47,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959795215] [2023-11-29 01:27:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:47,871 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 01:27:47,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:47,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959795215] [2023-11-29 01:27:47,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959795215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:47,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:47,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:27:47,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462904147] [2023-11-29 01:27:47,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:47,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:27:47,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:47,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:27:47,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:27:47,910 INFO L87 Difference]: Start difference. First operand has 187 states, 82 states have (on average 2.5609756097560976) internal successors, (210), 186 states have internal predecessors, (210), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 01:27:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:48,177 INFO L93 Difference]: Finished difference Result 251 states and 274 transitions. [2023-11-29 01:27:48,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:27:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-29 01:27:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:48,190 INFO L225 Difference]: With dead ends: 251 [2023-11-29 01:27:48,191 INFO L226 Difference]: Without dead ends: 250 [2023-11-29 01:27:48,192 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 01:27:48,196 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 177 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:48,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 166 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:27:48,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-29 01:27:48,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 177. [2023-11-29 01:27:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 82 states have (on average 2.3536585365853657) internal successors, (193), 176 states have internal predecessors, (193), 0 states have call successors, (0), 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 01:27:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 193 transitions. [2023-11-29 01:27:48,241 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 193 transitions. Word has length 2 [2023-11-29 01:27:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:48,242 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 193 transitions. [2023-11-29 01:27:48,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 01:27:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2023-11-29 01:27:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 01:27:48,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:48,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 01:27:48,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:27:48,243 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:48,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash 11940, now seen corresponding path program 1 times [2023-11-29 01:27:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:48,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924780834] [2023-11-29 01:27:48,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:48,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:48,328 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 01:27:48,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:48,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924780834] [2023-11-29 01:27:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924780834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:48,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:48,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:27:48,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429334715] [2023-11-29 01:27:48,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:48,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:27:48,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:48,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:27:48,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:27:48,332 INFO L87 Difference]: Start difference. First operand 177 states and 193 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 01:27:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:48,591 INFO L93 Difference]: Finished difference Result 294 states and 325 transitions. [2023-11-29 01:27:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:27:48,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-29 01:27:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:48,595 INFO L225 Difference]: With dead ends: 294 [2023-11-29 01:27:48,595 INFO L226 Difference]: Without dead ends: 294 [2023-11-29 01:27:48,595 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 01:27:48,597 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 139 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:48,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 248 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:27:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-11-29 01:27:48,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 172. [2023-11-29 01:27:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 82 states have (on average 2.292682926829268) internal successors, (188), 171 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 01:27:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 188 transitions. [2023-11-29 01:27:48,611 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 188 transitions. Word has length 2 [2023-11-29 01:27:48,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:48,611 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 188 transitions. [2023-11-29 01:27:48,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 01:27:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2023-11-29 01:27:48,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 01:27:48,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:48,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:48,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:27:48,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:48,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1491706194, now seen corresponding path program 1 times [2023-11-29 01:27:48,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:48,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39506688] [2023-11-29 01:27:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:48,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:48,781 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 01:27:48,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:48,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39506688] [2023-11-29 01:27:48,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39506688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:48,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:48,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:27:48,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775726757] [2023-11-29 01:27:48,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:48,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:27:48,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:48,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:27:48,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:27:48,784 INFO L87 Difference]: Start difference. First operand 172 states and 188 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 01:27:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:49,030 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2023-11-29 01:27:49,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:27:49,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-11-29 01:27:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:49,039 INFO L225 Difference]: With dead ends: 171 [2023-11-29 01:27:49,039 INFO L226 Difference]: Without dead ends: 171 [2023-11-29 01:27:49,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:27:49,041 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:49,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 423 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:27:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-29 01:27:49,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-11-29 01:27:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 82 states have (on average 2.2804878048780486) internal successors, (187), 170 states have internal predecessors, (187), 0 states have call successors, (0), 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 01:27:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2023-11-29 01:27:49,064 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 7 [2023-11-29 01:27:49,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:49,064 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2023-11-29 01:27:49,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 01:27:49,065 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2023-11-29 01:27:49,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 01:27:49,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:49,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:49,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:27:49,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:49,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1491706193, now seen corresponding path program 1 times [2023-11-29 01:27:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:49,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978132533] [2023-11-29 01:27:49,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:49,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:49,257 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 01:27:49,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:49,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978132533] [2023-11-29 01:27:49,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978132533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:49,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:49,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:27:49,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328620282] [2023-11-29 01:27:49,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:49,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:27:49,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:49,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:27:49,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:27:49,260 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 01:27:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:49,509 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2023-11-29 01:27:49,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:27:49,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-11-29 01:27:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:49,511 INFO L225 Difference]: With dead ends: 170 [2023-11-29 01:27:49,511 INFO L226 Difference]: Without dead ends: 170 [2023-11-29 01:27:49,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:27:49,513 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 2 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:49,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 436 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:27:49,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-29 01:27:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2023-11-29 01:27:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 82 states have (on average 2.268292682926829) internal successors, (186), 169 states have internal predecessors, (186), 0 states have call successors, (0), 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 01:27:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2023-11-29 01:27:49,520 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 7 [2023-11-29 01:27:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:49,521 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2023-11-29 01:27:49,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 01:27:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2023-11-29 01:27:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 01:27:49,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:49,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:49,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:27:49,522 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:49,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:49,523 INFO L85 PathProgramCache]: Analyzing trace with hash 617215464, now seen corresponding path program 1 times [2023-11-29 01:27:49,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:49,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010328774] [2023-11-29 01:27:49,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:49,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:49,659 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 01:27:49,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:49,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010328774] [2023-11-29 01:27:49,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010328774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:49,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:49,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:27:49,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253011933] [2023-11-29 01:27:49,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:49,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:27:49,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:49,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:27:49,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:27:49,662 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:49,996 INFO L93 Difference]: Finished difference Result 318 states and 346 transitions. [2023-11-29 01:27:49,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:27:49,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 01:27:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:49,999 INFO L225 Difference]: With dead ends: 318 [2023-11-29 01:27:49,999 INFO L226 Difference]: Without dead ends: 318 [2023-11-29 01:27:49,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:27:50,000 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 331 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:50,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 189 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:27:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-11-29 01:27:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 166. [2023-11-29 01:27:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 165 states have internal predecessors, (182), 0 states have call successors, (0), 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 01:27:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 182 transitions. [2023-11-29 01:27:50,008 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 182 transitions. Word has length 10 [2023-11-29 01:27:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:50,008 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 182 transitions. [2023-11-29 01:27:50,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2023-11-29 01:27:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 01:27:50,009 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:50,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:50,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:27:50,010 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:50,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:50,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1953810176, now seen corresponding path program 1 times [2023-11-29 01:27:50,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:50,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160211573] [2023-11-29 01:27:50,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:50,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:50,202 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 01:27:50,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160211573] [2023-11-29 01:27:50,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160211573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:50,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:50,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:27:50,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561389300] [2023-11-29 01:27:50,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:50,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:27:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:50,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:27:50,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:27:50,204 INFO L87 Difference]: Start difference. First operand 166 states and 182 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:50,690 INFO L93 Difference]: Finished difference Result 315 states and 351 transitions. [2023-11-29 01:27:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:27:50,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 01:27:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:50,696 INFO L225 Difference]: With dead ends: 315 [2023-11-29 01:27:50,697 INFO L226 Difference]: Without dead ends: 315 [2023-11-29 01:27:50,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:27:50,698 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 421 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:50,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 648 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:27:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-29 01:27:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 170. [2023-11-29 01:27:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 86 states have (on average 2.186046511627907) internal successors, (188), 169 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 01:27:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 188 transitions. [2023-11-29 01:27:50,705 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 188 transitions. Word has length 11 [2023-11-29 01:27:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:50,706 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 188 transitions. [2023-11-29 01:27:50,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 188 transitions. [2023-11-29 01:27:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 01:27:50,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:50,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:50,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:27:50,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:50,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:50,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1953810177, now seen corresponding path program 1 times [2023-11-29 01:27:50,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:50,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437406862] [2023-11-29 01:27:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:51,103 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 01:27:51,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:51,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437406862] [2023-11-29 01:27:51,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437406862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:51,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:51,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:27:51,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077223236] [2023-11-29 01:27:51,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:51,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:27:51,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:51,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:27:51,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:27:51,106 INFO L87 Difference]: Start difference. First operand 170 states and 188 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:51,837 INFO L93 Difference]: Finished difference Result 241 states and 271 transitions. [2023-11-29 01:27:51,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:27:51,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 01:27:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:51,839 INFO L225 Difference]: With dead ends: 241 [2023-11-29 01:27:51,839 INFO L226 Difference]: Without dead ends: 241 [2023-11-29 01:27:51,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:27:51,840 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 425 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:51,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 471 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:27:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-11-29 01:27:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 170. [2023-11-29 01:27:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 86 states have (on average 2.1744186046511627) internal successors, (187), 169 states have internal predecessors, (187), 0 states have call successors, (0), 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 01:27:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2023-11-29 01:27:51,846 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 11 [2023-11-29 01:27:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:51,846 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2023-11-29 01:27:51,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2023-11-29 01:27:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:27:51,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:51,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:51,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:27:51,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:51,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:51,848 INFO L85 PathProgramCache]: Analyzing trace with hash 438573322, now seen corresponding path program 1 times [2023-11-29 01:27:51,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:51,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271073797] [2023-11-29 01:27:51,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:51,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:51,894 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 01:27:51,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:51,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271073797] [2023-11-29 01:27:51,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271073797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:51,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:51,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:27:51,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340307104] [2023-11-29 01:27:51,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:51,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:27:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:51,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:27:51,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:27:51,896 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 01:27:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:52,085 INFO L93 Difference]: Finished difference Result 281 states and 313 transitions. [2023-11-29 01:27:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:27:52,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-29 01:27:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:52,087 INFO L225 Difference]: With dead ends: 281 [2023-11-29 01:27:52,087 INFO L226 Difference]: Without dead ends: 281 [2023-11-29 01:27:52,088 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 01:27:52,088 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 150 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:52,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 283 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:27:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-29 01:27:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 167. [2023-11-29 01:27:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 86 states have (on average 2.13953488372093) internal successors, (184), 166 states have internal predecessors, (184), 0 states have call successors, (0), 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 01:27:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2023-11-29 01:27:52,094 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 12 [2023-11-29 01:27:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:52,094 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2023-11-29 01:27:52,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 01:27:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2023-11-29 01:27:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:27:52,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:52,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:52,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:27:52,095 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:52,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash 438573323, now seen corresponding path program 1 times [2023-11-29 01:27:52,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:52,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913702541] [2023-11-29 01:27:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:52,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:52,178 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 01:27:52,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:52,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913702541] [2023-11-29 01:27:52,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913702541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:52,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:52,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:27:52,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568242497] [2023-11-29 01:27:52,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:52,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:27:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:52,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:27:52,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:27:52,181 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 01:27:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:52,352 INFO L93 Difference]: Finished difference Result 261 states and 293 transitions. [2023-11-29 01:27:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:27:52,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-29 01:27:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:52,355 INFO L225 Difference]: With dead ends: 261 [2023-11-29 01:27:52,355 INFO L226 Difference]: Without dead ends: 261 [2023-11-29 01:27:52,355 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 01:27:52,356 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 125 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:52,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 294 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:27:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-11-29 01:27:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 165. [2023-11-29 01:27:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 86 states have (on average 2.116279069767442) internal successors, (182), 164 states have internal predecessors, (182), 0 states have call successors, (0), 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 01:27:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 182 transitions. [2023-11-29 01:27:52,362 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 182 transitions. Word has length 12 [2023-11-29 01:27:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:52,362 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 182 transitions. [2023-11-29 01:27:52,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 01:27:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2023-11-29 01:27:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:27:52,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:52,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:52,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:27:52,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:52,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash 709699393, now seen corresponding path program 1 times [2023-11-29 01:27:52,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:52,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894393553] [2023-11-29 01:27:52,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:52,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:52,409 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 01:27:52,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:52,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894393553] [2023-11-29 01:27:52,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894393553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:52,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:52,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:27:52,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365523155] [2023-11-29 01:27:52,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:52,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:27:52,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:52,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:27:52,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:27:52,411 INFO L87 Difference]: Start difference. First operand 165 states and 182 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:52,638 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2023-11-29 01:27:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:27:52,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 01:27:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:52,640 INFO L225 Difference]: With dead ends: 226 [2023-11-29 01:27:52,640 INFO L226 Difference]: Without dead ends: 226 [2023-11-29 01:27:52,640 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 01:27:52,641 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 288 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:52,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 120 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:27:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-29 01:27:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 154. [2023-11-29 01:27:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 153 states have internal predecessors, (175), 0 states have call successors, (0), 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 01:27:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2023-11-29 01:27:52,646 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 13 [2023-11-29 01:27:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:52,647 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2023-11-29 01:27:52,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2023-11-29 01:27:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:27:52,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:52,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:52,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:27:52,648 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:52,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:52,648 INFO L85 PathProgramCache]: Analyzing trace with hash 709699394, now seen corresponding path program 1 times [2023-11-29 01:27:52,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:52,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112409256] [2023-11-29 01:27:52,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:52,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:52,735 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 01:27:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112409256] [2023-11-29 01:27:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112409256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:52,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:52,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:27:52,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698635471] [2023-11-29 01:27:52,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:52,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:27:52,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:52,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:27:52,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:27:52,737 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:53,089 INFO L93 Difference]: Finished difference Result 389 states and 443 transitions. [2023-11-29 01:27:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:27:53,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 01:27:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:53,092 INFO L225 Difference]: With dead ends: 389 [2023-11-29 01:27:53,092 INFO L226 Difference]: Without dead ends: 389 [2023-11-29 01:27:53,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:27:53,093 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 625 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:53,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 239 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:27:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-11-29 01:27:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 275. [2023-11-29 01:27:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 211 states have (on average 1.914691943127962) internal successors, (404), 274 states have internal predecessors, (404), 0 states have call successors, (0), 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 01:27:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 404 transitions. [2023-11-29 01:27:53,103 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 404 transitions. Word has length 13 [2023-11-29 01:27:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:53,103 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 404 transitions. [2023-11-29 01:27:53,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 404 transitions. [2023-11-29 01:27:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 01:27:53,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:53,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:53,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:27:53,104 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:53,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:53,105 INFO L85 PathProgramCache]: Analyzing trace with hash 562471561, now seen corresponding path program 1 times [2023-11-29 01:27:53,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:53,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263028752] [2023-11-29 01:27:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:53,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:53,246 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 01:27:53,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:53,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263028752] [2023-11-29 01:27:53,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263028752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:53,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:53,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:27:53,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985470312] [2023-11-29 01:27:53,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:53,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:27:53,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:53,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:27:53,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:27:53,248 INFO L87 Difference]: Start difference. First operand 275 states and 404 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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 01:27:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:53,704 INFO L93 Difference]: Finished difference Result 681 states and 1023 transitions. [2023-11-29 01:27:53,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:27:53,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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 01:27:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:53,709 INFO L225 Difference]: With dead ends: 681 [2023-11-29 01:27:53,709 INFO L226 Difference]: Without dead ends: 681 [2023-11-29 01:27:53,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:27:53,710 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 335 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:53,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 772 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:27:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-11-29 01:27:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 274. [2023-11-29 01:27:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 211 states have (on average 1.9099526066350712) internal successors, (403), 273 states have internal predecessors, (403), 0 states have call successors, (0), 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 01:27:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 403 transitions. [2023-11-29 01:27:53,720 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 403 transitions. Word has length 14 [2023-11-29 01:27:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:53,721 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 403 transitions. [2023-11-29 01:27:53,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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 01:27:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 403 transitions. [2023-11-29 01:27:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 01:27:53,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:53,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:53,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:27:53,722 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:53,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash 562471562, now seen corresponding path program 1 times [2023-11-29 01:27:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:53,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080484118] [2023-11-29 01:27:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:53,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:53,893 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 01:27:53,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:53,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080484118] [2023-11-29 01:27:53,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080484118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:53,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:53,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:27:53,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884098961] [2023-11-29 01:27:53,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:53,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:27:53,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:53,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:27:53,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:27:53,895 INFO L87 Difference]: Start difference. First operand 274 states and 403 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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 01:27:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:54,544 INFO L93 Difference]: Finished difference Result 680 states and 1022 transitions. [2023-11-29 01:27:54,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:27:54,545 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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 01:27:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:54,548 INFO L225 Difference]: With dead ends: 680 [2023-11-29 01:27:54,548 INFO L226 Difference]: Without dead ends: 680 [2023-11-29 01:27:54,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:27:54,549 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 327 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:54,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 796 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:27:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2023-11-29 01:27:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 273. [2023-11-29 01:27:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 211 states have (on average 1.90521327014218) internal successors, (402), 272 states have internal predecessors, (402), 0 states have call successors, (0), 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 01:27:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 402 transitions. [2023-11-29 01:27:54,557 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 402 transitions. Word has length 14 [2023-11-29 01:27:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:54,557 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 402 transitions. [2023-11-29 01:27:54,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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 01:27:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 402 transitions. [2023-11-29 01:27:54,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 01:27:54,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:54,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:54,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:27:54,558 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:54,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:54,559 INFO L85 PathProgramCache]: Analyzing trace with hash -878604630, now seen corresponding path program 1 times [2023-11-29 01:27:54,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:54,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215817131] [2023-11-29 01:27:54,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:54,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:54,584 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 01:27:54,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:54,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215817131] [2023-11-29 01:27:54,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215817131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:54,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:54,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:27:54,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512213960] [2023-11-29 01:27:54,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:54,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:27:54,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:54,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:27:54,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:27:54,586 INFO L87 Difference]: Start difference. First operand 273 states and 402 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 01:27:54,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:54,642 INFO L93 Difference]: Finished difference Result 341 states and 474 transitions. [2023-11-29 01:27:54,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:27:54,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 01:27:54,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:54,644 INFO L225 Difference]: With dead ends: 341 [2023-11-29 01:27:54,644 INFO L226 Difference]: Without dead ends: 341 [2023-11-29 01:27:54,644 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 01:27:54,645 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 144 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 235 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 01:27:54,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 235 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:27:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-11-29 01:27:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 307. [2023-11-29 01:27:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 245 states have (on average 1.9346938775510205) internal successors, (474), 306 states have internal predecessors, (474), 0 states have call successors, (0), 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 01:27:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 474 transitions. [2023-11-29 01:27:54,652 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 474 transitions. Word has length 15 [2023-11-29 01:27:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:54,652 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 474 transitions. [2023-11-29 01:27:54,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 01:27:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 474 transitions. [2023-11-29 01:27:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 01:27:54,653 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:54,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:54,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 01:27:54,654 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:54,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash -256134480, now seen corresponding path program 1 times [2023-11-29 01:27:54,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:54,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802170343] [2023-11-29 01:27:54,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:54,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:54,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802170343] [2023-11-29 01:27:54,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802170343] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:27:54,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162653251] [2023-11-29 01:27:54,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:54,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:27:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:54,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:27:55,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:27:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:55,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 01:27:55,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:55,181 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 01:27:55,202 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:27:55,202 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 01:27:55,226 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 19 treesize of output 1 [2023-11-29 01:27:55,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:27:55,288 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 31 treesize of output 32 [2023-11-29 01:27:55,309 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:27:55,310 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 01:27:55,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-29 01:27:55,393 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:27:55,394 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 42 treesize of output 41 [2023-11-29 01:27:55,438 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-29 01:27:55,438 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 1 case distinctions, treesize of input 18 treesize of output 20 [2023-11-29 01:27:55,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:27:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:55,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:27:55,558 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-11-29 01:27:55,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 01:27:55,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:27:55,832 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 26 treesize of output 27 [2023-11-29 01:27:55,836 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:27:55,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-11-29 01:27:55,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 01:27:55,851 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 01:27:55,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-29 01:27:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:55,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162653251] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:27:55,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:27:55,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 23 [2023-11-29 01:27:55,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006130412] [2023-11-29 01:27:55,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:27:55,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 01:27:55,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:55,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 01:27:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=464, Unknown=9, NotChecked=0, Total=552 [2023-11-29 01:27:55,877 INFO L87 Difference]: Start difference. First operand 307 states and 474 transitions. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 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 01:27:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:57,262 INFO L93 Difference]: Finished difference Result 706 states and 1039 transitions. [2023-11-29 01:27:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:27:57,263 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 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 01:27:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:57,267 INFO L225 Difference]: With dead ends: 706 [2023-11-29 01:27:57,267 INFO L226 Difference]: Without dead ends: 706 [2023-11-29 01:27:57,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=700, Unknown=9, NotChecked=0, Total=870 [2023-11-29 01:27:57,268 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 834 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 2550 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:57,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 2550 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 01:27:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2023-11-29 01:27:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 306. [2023-11-29 01:27:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 245 states have (on average 1.9306122448979592) internal successors, (473), 305 states have internal predecessors, (473), 0 states have call successors, (0), 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 01:27:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 473 transitions. [2023-11-29 01:27:57,276 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 473 transitions. Word has length 18 [2023-11-29 01:27:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:57,277 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 473 transitions. [2023-11-29 01:27:57,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 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 01:27:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 473 transitions. [2023-11-29 01:27:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 01:27:57,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:57,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:57,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:27:57,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:27:57,483 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:27:57,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash -256134479, now seen corresponding path program 1 times [2023-11-29 01:27:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:57,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855159684] [2023-11-29 01:27:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:58,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:58,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855159684] [2023-11-29 01:27:58,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855159684] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:27:58,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164762504] [2023-11-29 01:27:58,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:58,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:27:58,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:58,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:27:58,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:27:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:58,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 01:27:58,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:58,211 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 01:27:58,223 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:27:58,223 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 01:27:58,245 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 19 treesize of output 1 [2023-11-29 01:27:58,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:27:58,326 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 31 treesize of output 32 [2023-11-29 01:27:58,346 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:27:58,346 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 01:27:58,376 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 14 [2023-11-29 01:27:58,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:27:58,435 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 81 treesize of output 74 [2023-11-29 01:27:58,440 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 49 treesize of output 30 [2023-11-29 01:27:58,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:27:58,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-29 01:27:58,508 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2023-11-29 01:27:58,510 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 17 treesize of output 17 [2023-11-29 01:27:58,550 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 39 treesize of output 21 [2023-11-29 01:27:58,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-29 01:27:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:58,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:27:58,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:27:58,738 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 107 [2023-11-29 01:27:58,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:27:58,762 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 91 treesize of output 109 [2023-11-29 01:27:58,910 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 113 treesize of output 95 [2023-11-29 01:27:58,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2023-11-29 01:27:58,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2023-11-29 01:28:07,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:28:07,222 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 26 treesize of output 27 [2023-11-29 01:28:07,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:28:07,227 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 39 treesize of output 27 [2023-11-29 01:28:07,236 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 01:28:07,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-29 01:28:07,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 01:28:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:28:07,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164762504] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:28:07,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:28:07,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 29 [2023-11-29 01:28:07,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084875757] [2023-11-29 01:28:07,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:28:07,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 01:28:07,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:07,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 01:28:07,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=734, Unknown=11, NotChecked=0, Total=870 [2023-11-29 01:28:07,276 INFO L87 Difference]: Start difference. First operand 306 states and 473 transitions. Second operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 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 01:28:09,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:09,265 INFO L93 Difference]: Finished difference Result 587 states and 883 transitions. [2023-11-29 01:28:09,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:28:09,266 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 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 01:28:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:09,269 INFO L225 Difference]: With dead ends: 587 [2023-11-29 01:28:09,270 INFO L226 Difference]: Without dead ends: 587 [2023-11-29 01:28:09,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=226, Invalid=1023, Unknown=11, NotChecked=0, Total=1260 [2023-11-29 01:28:09,271 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 771 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 2594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:09,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1810 Invalid, 2594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 01:28:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2023-11-29 01:28:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 301. [2023-11-29 01:28:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 241 states have (on average 1.937759336099585) internal successors, (467), 300 states have internal predecessors, (467), 0 states have call successors, (0), 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 01:28:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 467 transitions. [2023-11-29 01:28:09,280 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 467 transitions. Word has length 18 [2023-11-29 01:28:09,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:09,281 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 467 transitions. [2023-11-29 01:28:09,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 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 01:28:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 467 transitions. [2023-11-29 01:28:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 01:28:09,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:09,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:28:09,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:28:09,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:28:09,496 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:09,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash -905517055, now seen corresponding path program 1 times [2023-11-29 01:28:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:09,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213423244] [2023-11-29 01:28:09,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:09,526 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 01:28:09,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:09,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213423244] [2023-11-29 01:28:09,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213423244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:09,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:09,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:28:09,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585231513] [2023-11-29 01:28:09,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:09,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:28:09,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:09,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:28:09,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:28:09,528 INFO L87 Difference]: Start difference. First operand 301 states and 467 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 01:28:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:09,586 INFO L93 Difference]: Finished difference Result 305 states and 471 transitions. [2023-11-29 01:28:09,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:28:09,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 01:28:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:09,588 INFO L225 Difference]: With dead ends: 305 [2023-11-29 01:28:09,588 INFO L226 Difference]: Without dead ends: 305 [2023-11-29 01:28:09,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:28:09,589 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:09,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:28:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-11-29 01:28:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2023-11-29 01:28:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 245 states have (on average 1.9224489795918367) internal successors, (471), 304 states have internal predecessors, (471), 0 states have call successors, (0), 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 01:28:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 471 transitions. [2023-11-29 01:28:09,597 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 471 transitions. Word has length 18 [2023-11-29 01:28:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:09,597 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 471 transitions. [2023-11-29 01:28:09,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 01:28:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 471 transitions. [2023-11-29 01:28:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 01:28:09,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:09,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:28:09,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 01:28:09,599 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:09,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash 184289742, now seen corresponding path program 1 times [2023-11-29 01:28:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898834183] [2023-11-29 01:28:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:09,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:28:09,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898834183] [2023-11-29 01:28:09,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898834183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:09,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:09,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:28:09,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15057301] [2023-11-29 01:28:09,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:09,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:28:09,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:09,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:28:09,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:28:09,631 INFO L87 Difference]: Start difference. First operand 305 states and 471 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 01:28:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:09,685 INFO L93 Difference]: Finished difference Result 308 states and 474 transitions. [2023-11-29 01:28:09,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:28:09,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 01:28:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:09,687 INFO L225 Difference]: With dead ends: 308 [2023-11-29 01:28:09,688 INFO L226 Difference]: Without dead ends: 308 [2023-11-29 01:28:09,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:28:09,688 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:09,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:28:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-11-29 01:28:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2023-11-29 01:28:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 248 states have (on average 1.9112903225806452) internal successors, (474), 307 states have internal predecessors, (474), 0 states have call successors, (0), 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 01:28:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 474 transitions. [2023-11-29 01:28:09,696 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 474 transitions. Word has length 18 [2023-11-29 01:28:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:09,696 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 474 transitions. [2023-11-29 01:28:09,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 01:28:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 474 transitions. [2023-11-29 01:28:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 01:28:09,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:09,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:28:09,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 01:28:09,698 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:09,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1999408612, now seen corresponding path program 1 times [2023-11-29 01:28:09,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:09,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089448799] [2023-11-29 01:28:09,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:09,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:09,734 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 01:28:09,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:09,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089448799] [2023-11-29 01:28:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089448799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:09,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:09,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:28:09,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121164674] [2023-11-29 01:28:09,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:09,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:28:09,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:09,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:28:09,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:28:09,737 INFO L87 Difference]: Start difference. First operand 308 states and 474 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:28:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:09,811 INFO L93 Difference]: Finished difference Result 343 states and 495 transitions. [2023-11-29 01:28:09,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:28:09,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 01:28:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:09,814 INFO L225 Difference]: With dead ends: 343 [2023-11-29 01:28:09,814 INFO L226 Difference]: Without dead ends: 343 [2023-11-29 01:28:09,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:28:09,815 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 46 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:09,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 258 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:28:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-11-29 01:28:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 295. [2023-11-29 01:28:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 235 states have (on average 1.9063829787234043) internal successors, (448), 294 states have internal predecessors, (448), 0 states have call successors, (0), 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 01:28:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 448 transitions. [2023-11-29 01:28:09,823 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 448 transitions. Word has length 19 [2023-11-29 01:28:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:09,823 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 448 transitions. [2023-11-29 01:28:09,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:28:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 448 transitions. [2023-11-29 01:28:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 01:28:09,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:09,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:28:09,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 01:28:09,824 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:09,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:09,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1481409960, now seen corresponding path program 1 times [2023-11-29 01:28:09,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:09,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474825505] [2023-11-29 01:28:09,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:09,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:28:10,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:10,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474825505] [2023-11-29 01:28:10,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474825505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:10,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:10,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:28:10,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730645884] [2023-11-29 01:28:10,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:10,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:28:10,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:10,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:28:10,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:28:10,146 INFO L87 Difference]: Start difference. First operand 295 states and 448 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:28:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:10,837 INFO L93 Difference]: Finished difference Result 499 states and 678 transitions. [2023-11-29 01:28:10,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:28:10,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 01:28:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:10,840 INFO L225 Difference]: With dead ends: 499 [2023-11-29 01:28:10,840 INFO L226 Difference]: Without dead ends: 499 [2023-11-29 01:28:10,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:28:10,841 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 305 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:10,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 945 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:28:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2023-11-29 01:28:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 310. [2023-11-29 01:28:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 250 states have (on average 1.876) internal successors, (469), 309 states have internal predecessors, (469), 0 states have call successors, (0), 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 01:28:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 469 transitions. [2023-11-29 01:28:10,850 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 469 transitions. Word has length 19 [2023-11-29 01:28:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:10,851 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 469 transitions. [2023-11-29 01:28:10,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:28:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 469 transitions. [2023-11-29 01:28:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 01:28:10,852 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:10,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:28:10,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 01:28:10,852 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:10,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1677655270, now seen corresponding path program 1 times [2023-11-29 01:28:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807082495] [2023-11-29 01:28:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:28:11,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807082495] [2023-11-29 01:28:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807082495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:11,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:11,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:28:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25424755] [2023-11-29 01:28:11,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:11,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:28:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:11,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:28:11,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:28:11,178 INFO L87 Difference]: Start difference. First operand 310 states and 469 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 01:28:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:11,853 INFO L93 Difference]: Finished difference Result 497 states and 674 transitions. [2023-11-29 01:28:11,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:28:11,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 01:28:11,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:11,856 INFO L225 Difference]: With dead ends: 497 [2023-11-29 01:28:11,856 INFO L226 Difference]: Without dead ends: 497 [2023-11-29 01:28:11,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:28:11,857 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 386 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:11,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 704 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:28:11,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2023-11-29 01:28:11,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 346. [2023-11-29 01:28:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 286 states have (on average 1.8776223776223777) internal successors, (537), 345 states have internal predecessors, (537), 0 states have call successors, (0), 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 01:28:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 537 transitions. [2023-11-29 01:28:11,864 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 537 transitions. Word has length 20 [2023-11-29 01:28:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:11,865 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 537 transitions. [2023-11-29 01:28:11,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 01:28:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 537 transitions. [2023-11-29 01:28:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 01:28:11,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:11,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:28:11,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 01:28:11,866 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:11,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:11,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1581829259, now seen corresponding path program 1 times [2023-11-29 01:28:11,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:11,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724894879] [2023-11-29 01:28:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:11,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:12,074 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 01:28:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:12,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724894879] [2023-11-29 01:28:12,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724894879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:12,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:12,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:28:12,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89425372] [2023-11-29 01:28:12,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:12,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:28:12,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:12,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:28:12,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:28:12,076 INFO L87 Difference]: Start difference. First operand 346 states and 537 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 01:28:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:12,734 INFO L93 Difference]: Finished difference Result 525 states and 782 transitions. [2023-11-29 01:28:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:28:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 01:28:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:12,738 INFO L225 Difference]: With dead ends: 525 [2023-11-29 01:28:12,738 INFO L226 Difference]: Without dead ends: 525 [2023-11-29 01:28:12,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:28:12,739 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 561 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:12,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 648 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:28:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-11-29 01:28:12,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 353. [2023-11-29 01:28:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 293 states have (on average 1.863481228668942) internal successors, (546), 352 states have internal predecessors, (546), 0 states have call successors, (0), 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 01:28:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 546 transitions. [2023-11-29 01:28:12,749 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 546 transitions. Word has length 21 [2023-11-29 01:28:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:12,749 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 546 transitions. [2023-11-29 01:28:12,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 01:28:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 546 transitions. [2023-11-29 01:28:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 01:28:12,750 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:12,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:28:12,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 01:28:12,761 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:12,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1581829260, now seen corresponding path program 1 times [2023-11-29 01:28:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686439825] [2023-11-29 01:28:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:12,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:13,067 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 01:28:13,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686439825] [2023-11-29 01:28:13,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686439825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:13,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:13,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:28:13,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139260417] [2023-11-29 01:28:13,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:13,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:28:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:13,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:28:13,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:28:13,069 INFO L87 Difference]: Start difference. First operand 353 states and 546 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 01:28:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:13,912 INFO L93 Difference]: Finished difference Result 533 states and 790 transitions. [2023-11-29 01:28:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:28:13,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 01:28:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:13,918 INFO L225 Difference]: With dead ends: 533 [2023-11-29 01:28:13,918 INFO L226 Difference]: Without dead ends: 533 [2023-11-29 01:28:13,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:28:13,919 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 302 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:13,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 502 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 01:28:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2023-11-29 01:28:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 353. [2023-11-29 01:28:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 293 states have (on average 1.8600682593856654) internal successors, (545), 352 states have internal predecessors, (545), 0 states have call successors, (0), 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 01:28:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 545 transitions. [2023-11-29 01:28:13,929 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 545 transitions. Word has length 21 [2023-11-29 01:28:13,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:13,929 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 545 transitions. [2023-11-29 01:28:13,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 01:28:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 545 transitions. [2023-11-29 01:28:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 01:28:13,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:13,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:28:13,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 01:28:13,930 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:13,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:13,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1582478857, now seen corresponding path program 1 times [2023-11-29 01:28:13,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:13,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046296617] [2023-11-29 01:28:13,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:13,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:28:14,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046296617] [2023-11-29 01:28:14,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046296617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:14,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:14,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:28:14,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089549491] [2023-11-29 01:28:14,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:14,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:28:14,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:28:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:28:14,037 INFO L87 Difference]: Start difference. First operand 353 states and 545 transitions. Second operand has 5 states, 5 states have (on average 4.2) 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 01:28:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:14,191 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2023-11-29 01:28:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:28:14,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) 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 01:28:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:14,193 INFO L225 Difference]: With dead ends: 452 [2023-11-29 01:28:14,193 INFO L226 Difference]: Without dead ends: 452 [2023-11-29 01:28:14,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:28:14,194 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 111 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:14,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 280 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:28:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-11-29 01:28:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 362. [2023-11-29 01:28:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 302 states have (on average 1.8443708609271523) internal successors, (557), 361 states have internal predecessors, (557), 0 states have call successors, (0), 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 01:28:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 557 transitions. [2023-11-29 01:28:14,200 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 557 transitions. Word has length 21 [2023-11-29 01:28:14,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:14,201 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 557 transitions. [2023-11-29 01:28:14,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) 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 01:28:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 557 transitions. [2023-11-29 01:28:14,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 01:28:14,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:14,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:28:14,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 01:28:14,202 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:14,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:14,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1582484747, now seen corresponding path program 1 times [2023-11-29 01:28:14,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:14,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594391574] [2023-11-29 01:28:14,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:14,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:28:14,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:14,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594391574] [2023-11-29 01:28:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594391574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:14,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:28:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406941324] [2023-11-29 01:28:14,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:14,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:28:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:14,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:28:14,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:28:14,511 INFO L87 Difference]: Start difference. First operand 362 states and 557 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 01:28:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:15,083 INFO L93 Difference]: Finished difference Result 481 states and 695 transitions. [2023-11-29 01:28:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:28:15,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 01:28:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:15,086 INFO L225 Difference]: With dead ends: 481 [2023-11-29 01:28:15,087 INFO L226 Difference]: Without dead ends: 481 [2023-11-29 01:28:15,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:28:15,087 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 536 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:15,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 524 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:28:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2023-11-29 01:28:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 327. [2023-11-29 01:28:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 267 states have (on average 1.8314606741573034) internal successors, (489), 326 states have internal predecessors, (489), 0 states have call successors, (0), 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 01:28:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 489 transitions. [2023-11-29 01:28:15,093 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 489 transitions. Word has length 21 [2023-11-29 01:28:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:15,093 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 489 transitions. [2023-11-29 01:28:15,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 01:28:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 489 transitions. [2023-11-29 01:28:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 01:28:15,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:15,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:28:15,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 01:28:15,095 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:15,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash -145879624, now seen corresponding path program 1 times [2023-11-29 01:28:15,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:15,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144667010] [2023-11-29 01:28:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:15,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:15,122 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 01:28:15,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:15,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144667010] [2023-11-29 01:28:15,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144667010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:15,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:15,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:28:15,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901520751] [2023-11-29 01:28:15,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:15,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:28:15,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:15,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:28:15,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:28:15,125 INFO L87 Difference]: Start difference. First operand 327 states and 489 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 01:28:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:15,178 INFO L93 Difference]: Finished difference Result 331 states and 493 transitions. [2023-11-29 01:28:15,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:28:15,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 01:28:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:15,181 INFO L225 Difference]: With dead ends: 331 [2023-11-29 01:28:15,181 INFO L226 Difference]: Without dead ends: 331 [2023-11-29 01:28:15,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:28:15,181 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:15,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:28:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-29 01:28:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2023-11-29 01:28:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 271 states have (on average 1.8191881918819188) internal successors, (493), 330 states have internal predecessors, (493), 0 states have call successors, (0), 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 01:28:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 493 transitions. [2023-11-29 01:28:15,187 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 493 transitions. Word has length 21 [2023-11-29 01:28:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:15,188 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 493 transitions. [2023-11-29 01:28:15,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 01:28:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 493 transitions. [2023-11-29 01:28:15,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 01:28:15,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:15,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:28:15,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 01:28:15,189 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:15,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash -145939206, now seen corresponding path program 1 times [2023-11-29 01:28:15,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:15,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877590015] [2023-11-29 01:28:15,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:15,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:15,233 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 01:28:15,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:15,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877590015] [2023-11-29 01:28:15,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877590015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:15,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:15,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:28:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64347550] [2023-11-29 01:28:15,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:15,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:28:15,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:15,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:28:15,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:28:15,235 INFO L87 Difference]: Start difference. First operand 331 states and 493 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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 01:28:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:15,352 INFO L93 Difference]: Finished difference Result 326 states and 488 transitions. [2023-11-29 01:28:15,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:28:15,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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 01:28:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:15,354 INFO L225 Difference]: With dead ends: 326 [2023-11-29 01:28:15,354 INFO L226 Difference]: Without dead ends: 326 [2023-11-29 01:28:15,355 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 01:28:15,355 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 26 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:15,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 181 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:28:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-11-29 01:28:15,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2023-11-29 01:28:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 271 states have (on average 1.8007380073800738) internal successors, (488), 325 states have internal predecessors, (488), 0 states have call successors, (0), 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 01:28:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 488 transitions. [2023-11-29 01:28:15,361 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 488 transitions. Word has length 21 [2023-11-29 01:28:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:15,362 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 488 transitions. [2023-11-29 01:28:15,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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 01:28:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 488 transitions. [2023-11-29 01:28:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 01:28:15,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:15,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:28:15,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 01:28:15,363 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:15,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:15,363 INFO L85 PathProgramCache]: Analyzing trace with hash -145939205, now seen corresponding path program 1 times [2023-11-29 01:28:15,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:15,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171238430] [2023-11-29 01:28:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:15,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:15,428 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 01:28:15,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:15,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171238430] [2023-11-29 01:28:15,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171238430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:15,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:15,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:28:15,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257586858] [2023-11-29 01:28:15,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:15,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:28:15,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:15,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:28:15,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:28:15,430 INFO L87 Difference]: Start difference. First operand 326 states and 488 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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 01:28:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:15,557 INFO L93 Difference]: Finished difference Result 321 states and 483 transitions. [2023-11-29 01:28:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:28:15,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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 01:28:15,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:15,559 INFO L225 Difference]: With dead ends: 321 [2023-11-29 01:28:15,560 INFO L226 Difference]: Without dead ends: 321 [2023-11-29 01:28:15,560 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 01:28:15,560 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:15,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 181 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:28:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-29 01:28:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2023-11-29 01:28:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 271 states have (on average 1.7822878228782288) internal successors, (483), 320 states have internal predecessors, (483), 0 states have call successors, (0), 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 01:28:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 483 transitions. [2023-11-29 01:28:15,565 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 483 transitions. Word has length 21 [2023-11-29 01:28:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:15,565 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 483 transitions. [2023-11-29 01:28:15,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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 01:28:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 483 transitions. [2023-11-29 01:28:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 01:28:15,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:15,566 INFO L195 NwaCegarLoop]: trace histogram [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 01:28:15,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 01:28:15,566 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:15,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash -105465677, now seen corresponding path program 1 times [2023-11-29 01:28:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:15,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809463407] [2023-11-29 01:28:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:15,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:15,794 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 01:28:15,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:15,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809463407] [2023-11-29 01:28:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809463407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:15,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:15,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:28:15,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842870324] [2023-11-29 01:28:15,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:15,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:28:15,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:15,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:28:15,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:28:15,796 INFO L87 Difference]: Start difference. First operand 321 states and 483 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:28:16,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:16,291 INFO L93 Difference]: Finished difference Result 468 states and 682 transitions. [2023-11-29 01:28:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:28:16,292 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-29 01:28:16,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:16,294 INFO L225 Difference]: With dead ends: 468 [2023-11-29 01:28:16,294 INFO L226 Difference]: Without dead ends: 468 [2023-11-29 01:28:16,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:28:16,295 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 364 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:16,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 513 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:28:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-11-29 01:28:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 324. [2023-11-29 01:28:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 274 states have (on average 1.7773722627737227) internal successors, (487), 323 states have internal predecessors, (487), 0 states have call successors, (0), 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 01:28:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 487 transitions. [2023-11-29 01:28:16,302 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 487 transitions. Word has length 24 [2023-11-29 01:28:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:16,302 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 487 transitions. [2023-11-29 01:28:16,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:28:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 487 transitions. [2023-11-29 01:28:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 01:28:16,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:16,303 INFO L195 NwaCegarLoop]: trace histogram [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 01:28:16,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 01:28:16,303 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:16,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash -105464586, now seen corresponding path program 1 times [2023-11-29 01:28:16,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:16,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283282422] [2023-11-29 01:28:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:16,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:16,365 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 01:28:16,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:16,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283282422] [2023-11-29 01:28:16,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283282422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:16,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:16,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:28:16,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061454256] [2023-11-29 01:28:16,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:16,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:28:16,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:16,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:28:16,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:28:16,367 INFO L87 Difference]: Start difference. First operand 324 states and 487 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:28:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:16,598 INFO L93 Difference]: Finished difference Result 323 states and 483 transitions. [2023-11-29 01:28:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:28:16,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-29 01:28:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:16,600 INFO L225 Difference]: With dead ends: 323 [2023-11-29 01:28:16,600 INFO L226 Difference]: Without dead ends: 323 [2023-11-29 01:28:16,600 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 01:28:16,601 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 23 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:16,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 279 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:28:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-11-29 01:28:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2023-11-29 01:28:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 274 states have (on average 1.7627737226277371) internal successors, (483), 322 states have internal predecessors, (483), 0 states have call successors, (0), 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 01:28:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 483 transitions. [2023-11-29 01:28:16,607 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 483 transitions. Word has length 24 [2023-11-29 01:28:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:16,607 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 483 transitions. [2023-11-29 01:28:16,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:28:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 483 transitions. [2023-11-29 01:28:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 01:28:16,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:16,608 INFO L195 NwaCegarLoop]: trace histogram [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 01:28:16,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 01:28:16,608 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:16,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:16,608 INFO L85 PathProgramCache]: Analyzing trace with hash -105464585, now seen corresponding path program 1 times [2023-11-29 01:28:16,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:16,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967677175] [2023-11-29 01:28:16,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:16,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:16,714 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 01:28:16,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:16,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967677175] [2023-11-29 01:28:16,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967677175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:16,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:16,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:28:16,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156144587] [2023-11-29 01:28:16,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:16,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:28:16,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:16,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:28:16,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:28:16,716 INFO L87 Difference]: Start difference. First operand 323 states and 483 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:28:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:16,974 INFO L93 Difference]: Finished difference Result 322 states and 479 transitions. [2023-11-29 01:28:16,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:28:16,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-29 01:28:16,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:16,976 INFO L225 Difference]: With dead ends: 322 [2023-11-29 01:28:16,976 INFO L226 Difference]: Without dead ends: 322 [2023-11-29 01:28:16,976 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 01:28:16,976 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 31 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:16,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 266 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:28:16,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-29 01:28:16,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2023-11-29 01:28:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 274 states have (on average 1.7481751824817517) internal successors, (479), 321 states have internal predecessors, (479), 0 states have call successors, (0), 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 01:28:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 479 transitions. [2023-11-29 01:28:16,981 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 479 transitions. Word has length 24 [2023-11-29 01:28:16,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:16,981 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 479 transitions. [2023-11-29 01:28:16,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:28:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 479 transitions. [2023-11-29 01:28:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 01:28:16,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:16,981 INFO L195 NwaCegarLoop]: trace histogram [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 01:28:16,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 01:28:16,982 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:16,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1025531656, now seen corresponding path program 1 times [2023-11-29 01:28:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:16,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343089371] [2023-11-29 01:28:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:17,168 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 01:28:17,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:17,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343089371] [2023-11-29 01:28:17,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343089371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:28:17,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:28:17,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:28:17,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273158296] [2023-11-29 01:28:17,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:28:17,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:28:17,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:28:17,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:28:17,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:28:17,170 INFO L87 Difference]: Start difference. First operand 322 states and 479 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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 01:28:17,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:28:17,742 INFO L93 Difference]: Finished difference Result 459 states and 665 transitions. [2023-11-29 01:28:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:28:17,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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 01:28:17,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:28:17,745 INFO L225 Difference]: With dead ends: 459 [2023-11-29 01:28:17,745 INFO L226 Difference]: Without dead ends: 459 [2023-11-29 01:28:17,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:28:17,746 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 225 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:28:17,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 624 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:28:17,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2023-11-29 01:28:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 323. [2023-11-29 01:28:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 275 states have (on average 1.7454545454545454) internal successors, (480), 322 states have internal predecessors, (480), 0 states have call successors, (0), 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 01:28:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 480 transitions. [2023-11-29 01:28:17,752 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 480 transitions. Word has length 25 [2023-11-29 01:28:17,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:28:17,752 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 480 transitions. [2023-11-29 01:28:17,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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 01:28:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 480 transitions. [2023-11-29 01:28:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 01:28:17,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:28:17,753 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, 1] [2023-11-29 01:28:17,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 01:28:17,754 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:28:17,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:28:17,754 INFO L85 PathProgramCache]: Analyzing trace with hash -276512424, now seen corresponding path program 1 times [2023-11-29 01:28:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:28:17,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277347527] [2023-11-29 01:28:17,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:17,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:28:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:28:18,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:28:18,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277347527] [2023-11-29 01:28:18,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277347527] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:28:18,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419800874] [2023-11-29 01:28:18,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:28:18,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:28:18,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:28:18,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:28:18,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:28:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:28:18,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 01:28:18,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:28:18,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:28:18,399 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 01:28:18,406 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 01:28:18,437 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 01:28:18,445 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 01:28:18,458 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:28:18,458 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 01:28:18,515 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 01:28:18,527 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 30 treesize of output 21 [2023-11-29 01:28:18,639 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:28:18,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2023-11-29 01:28:18,643 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 16 [2023-11-29 01:28:18,693 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:28:18,693 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 01:28:18,844 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 40 treesize of output 29 [2023-11-29 01:28:18,857 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 01:28:18,981 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:28:18,982 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 64 treesize of output 55 [2023-11-29 01:28:18,991 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 16 [2023-11-29 01:28:19,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:28:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:28:19,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:28:19,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1114 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse0 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1113 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse1 .cse0 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) 1)))))) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse3 0) (= (select |c_#valid| .cse3) 1)))))) is different from false [2023-11-29 01:28:19,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:28:19,626 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 102 treesize of output 158 [2023-11-29 01:28:19,865 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse0 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store .cse1 .cse0 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)))))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse4) (= 0 .cse4) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) .cse4))))) (or (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse7 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse7) (= 0 .cse7)))) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse10 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse10) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (let ((.cse12 (select (select (store .cse13 .cse11 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (forall ((v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse11 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse12) (= .cse12 .cse10))))))))) (forall ((v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (let ((.cse16 (select (select (store .cse18 .cse15 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse15 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse16) (= .cse16 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))))))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse19 (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse19) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse20 (select (select (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse20) (= .cse20 .cse19)))) (= 0 .cse19)))))) is different from false [2023-11-29 01:28:20,000 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (let ((.cse2 (select (select (store .cse5 .cse0 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse0 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= .cse1 .cse2) (= .cse2 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))))))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse6 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse1 .cse6) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (let ((.cse8 (select (select (store .cse9 .cse7 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (forall ((v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse7 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse1 .cse8) (= .cse8 .cse6))))))))) (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (= .cse1 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse12 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= 0 .cse12) (= .cse1 .cse12))))) (or (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (= .cse1 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (forall ((v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse15 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= .cse1 (select (select (store .cse16 .cse15 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))))))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse17 (select (select (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= 0 .cse17) (= .cse1 .cse17) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (= (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) .cse17))))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse21 (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse20 (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse1 .cse20) (= .cse20 .cse21)))) (= 0 .cse21) (= .cse1 .cse21))))))) is different from false [2023-11-29 01:28:22,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:28:22,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1380 treesize of output 1534 [2023-11-29 01:32:56,271 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tree~0#1.base|)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (and (forall ((v_prenex_94 (Array Int Int)) (v_prenex_93 (Array Int Int)) (v_prenex_90 Int) (v_prenex_92 (Array Int Int)) (v_prenex_91 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_96 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_prenex_98 Int) (v_prenex_89 (Array Int Int))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_95))) (let ((.cse8 (store .cse7 v_prenex_90 v_prenex_94))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) (.cse2 (select (select (store .cse8 .cse5 v_prenex_92) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) (.cse1 (select (select (let ((.cse6 (store .cse7 v_prenex_90 v_prenex_97))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_96)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= v_prenex_90 |c_ULTIMATE.start_main_~tree~0#1.base|) (= .cse0 .cse1) (= .cse2 .cse0) (= .cse2 .cse1) (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store .cse3 .cse4 v_prenex_98)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_89) v_prenex_90 v_prenex_93) .cse5 v_prenex_91) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))))))) (forall ((v_prenex_76 (Array Int Int)) (v_prenex_75 (Array Int Int)) (v_prenex_74 (Array Int Int)) (v_prenex_73 Int) (v_prenex_78 (Array Int Int)) (v_prenex_77 (Array Int Int))) (let ((.cse13 (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_76))) (let ((.cse10 (select (select (let ((.cse14 (store .cse13 v_prenex_73 v_prenex_78))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_77)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) (.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (or (= .cse10 .cse11) (= .cse10 0) (= v_prenex_73 |c_ULTIMATE.start_main_~tree~0#1.base|) (= (select (select (let ((.cse12 (store .cse13 v_prenex_73 v_prenex_75))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_74)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) .cse11))))) (forall ((v_prenex_83 (Array Int Int)) (v_prenex_82 (Array Int Int)) (v_prenex_81 (Array Int Int)) (v_prenex_87 (Array Int Int)) (v_prenex_88 Int) (v_prenex_86 (Array Int Int)) (v_prenex_85 (Array Int Int)) (v_prenex_84 (Array Int Int)) (v_prenex_79 (Array Int Int)) (v_prenex_80 Int)) (let ((.cse17 (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_85))) (let ((.cse18 (store .cse17 v_prenex_80 v_prenex_84))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) (.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (or (= .cse15 (select (select (let ((.cse16 (store .cse17 v_prenex_80 v_prenex_87))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_86)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) (= .cse15 (select (select (store .cse18 .cse19 v_prenex_82) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) (= v_prenex_80 |c_ULTIMATE.start_main_~tree~0#1.base|) (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store .cse3 .cse4 v_prenex_88)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_79) v_prenex_80 v_prenex_83) .cse19 v_prenex_81) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))))) (forall ((v_prenex_72 (Array Int Int)) (v_ArrVal_1109 (Array Int Int)) (v_prenex_71 (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_prenex_67 Int) (v_ArrVal_1114 (Array Int Int)) (v_prenex_69 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_prenex_68 (Array Int Int)) (v_ArrVal_1106 Int)) (let ((.cse20 (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_70))) (let ((.cse24 (store .cse20 v_prenex_67 v_prenex_69))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (let ((.cse21 (select (select (store .cse24 .cse22 v_prenex_68) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select (select .cse20 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) .cse21) (= v_prenex_67 |c_ULTIMATE.start_main_~tree~0#1.base|) (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store .cse3 .cse4 v_ArrVal_1106)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1109) v_prenex_67 v_ArrVal_1112) .cse22 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= .cse21 (select (select (let ((.cse23 (store .cse20 v_prenex_67 v_prenex_72))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_71)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)))))))) (forall ((v_prenex_99 Int)) (or (forall ((v_prenex_100 (Array Int Int)) (v_prenex_101 (Array Int Int)) (v_prenex_102 (Array Int Int)) (v_prenex_103 (Array Int Int)) (v_prenex_104 (Array Int Int))) (let ((.cse27 (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_102))) (let ((.cse25 (select (select (let ((.cse28 (store .cse27 v_prenex_99 v_prenex_104))) (store .cse28 (select (select .cse28 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_103)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse25 (select (select (let ((.cse26 (store .cse27 v_prenex_99 v_prenex_101))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_100)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) (= (select (select .cse27 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) .cse25) (= .cse25 0))))) (= v_prenex_99 |c_ULTIMATE.start_main_~tree~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_40| Int) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse32 (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1110))) (let ((.cse30 (select (select (let ((.cse34 (store .cse32 |v_ULTIMATE.start_main_~tmpList~0#1.base_40| v_ArrVal_1111))) (store .cse34 (select (select .cse34 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) (.cse29 (select (select (let ((.cse33 (store .cse32 |v_ULTIMATE.start_main_~tmpList~0#1.base_40| v_prenex_4))) (store .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) (.cse31 (select (select .cse32 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (or (= .cse29 .cse30) (= .cse29 0) (= .cse30 .cse31) (= .cse29 .cse31) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_40| |c_ULTIMATE.start_main_~tree~0#1.base|))))) (forall ((v_ArrVal_1109 (Array Int Int)) (v_prenex_72 (Array Int Int)) (v_prenex_71 (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_prenex_67 Int) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_prenex_69 (Array Int Int)) (v_prenex_68 (Array Int Int)) (v_ArrVal_1106 Int)) (let ((.cse35 (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_70))) (let ((.cse39 (store .cse35 v_prenex_67 v_prenex_69))) (let ((.cse37 (select (select .cse39 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (let ((.cse36 (select (select (store .cse39 .cse37 v_prenex_68) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select (select .cse35 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) .cse36) (= v_prenex_67 |c_ULTIMATE.start_main_~tree~0#1.base|) (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store .cse3 .cse4 v_ArrVal_1106)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1109) v_prenex_67 v_ArrVal_1112) .cse37 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= .cse36 (select (select (let ((.cse38 (store .cse35 v_prenex_67 v_prenex_72))) (store .cse38 (select (select .cse38 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_71)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))))))))))) is different from false [2023-11-29 01:33:10,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:10,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 75 [2023-11-29 01:33:10,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:10,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 354 treesize of output 184 [2023-11-29 01:33:10,400 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:33:10,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 3624 treesize of output 2312 [2023-11-29 01:33:10,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:33:10,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:33:10,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2023-11-29 01:33:10,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 01:33:10,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 01:33:10,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:33:10,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 01:33:10,492 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:33:10,507 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-29 01:33:10,508 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 3 case distinctions, treesize of input 247 treesize of output 1 [2023-11-29 01:33:10,524 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-29 01:33:10,524 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 3 case distinctions, treesize of input 372 treesize of output 1 [2023-11-29 01:33:10,532 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:33:10,548 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-29 01:33:10,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 1 [2023-11-29 01:33:10,562 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-29 01:33:10,563 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 3 case distinctions, treesize of input 281 treesize of output 1 [2023-11-29 01:33:10,813 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 01:33:10,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419800874] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:33:10,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:33:10,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 16] total 39 [2023-11-29 01:33:10,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985563667] [2023-11-29 01:33:10,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:33:10,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 01:33:10,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:10,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 01:33:10,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=993, Unknown=41, NotChecked=276, Total=1482 [2023-11-29 01:33:10,817 INFO L87 Difference]: Start difference. First operand 323 states and 480 transitions. Second operand has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 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 01:33:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:30,911 INFO L93 Difference]: Finished difference Result 657 states and 888 transitions. [2023-11-29 01:33:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 01:33:30,912 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 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 26 [2023-11-29 01:33:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:33:30,915 INFO L225 Difference]: With dead ends: 657 [2023-11-29 01:33:30,915 INFO L226 Difference]: Without dead ends: 657 [2023-11-29 01:33:30,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=550, Invalid=2503, Unknown=43, NotChecked=444, Total=3540 [2023-11-29 01:33:30,916 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 1342 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 2647 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 4631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1880 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:33:30,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 1550 Invalid, 4631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2647 Invalid, 0 Unknown, 1880 Unchecked, 15.7s Time] [2023-11-29 01:33:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2023-11-29 01:33:30,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 337. [2023-11-29 01:33:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 289 states have (on average 1.726643598615917) internal successors, (499), 336 states have internal predecessors, (499), 0 states have call successors, (0), 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 01:33:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 499 transitions. [2023-11-29 01:33:30,922 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 499 transitions. Word has length 26 [2023-11-29 01:33:30,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:33:30,922 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 499 transitions. [2023-11-29 01:33:30,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 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 01:33:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 499 transitions. [2023-11-29 01:33:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 01:33:30,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:30,923 INFO L195 NwaCegarLoop]: trace histogram [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 01:33:30,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 01:33:31,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:33:31,124 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:33:31,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1726710613, now seen corresponding path program 1 times [2023-11-29 01:33:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675525205] [2023-11-29 01:33:31,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:31,194 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 01:33:31,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675525205] [2023-11-29 01:33:31,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675525205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:31,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:31,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:33:31,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076852750] [2023-11-29 01:33:31,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:31,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:33:31,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:31,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:33:31,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:33:31,196 INFO L87 Difference]: Start difference. First operand 337 states and 499 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:31,744 INFO L93 Difference]: Finished difference Result 336 states and 495 transitions. [2023-11-29 01:33:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:33:31,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 01:33:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:33:31,747 INFO L225 Difference]: With dead ends: 336 [2023-11-29 01:33:31,747 INFO L226 Difference]: Without dead ends: 336 [2023-11-29 01:33:31,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:33:31,748 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 22 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:33:31,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 271 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:33:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-11-29 01:33:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2023-11-29 01:33:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 289 states have (on average 1.71280276816609) internal successors, (495), 335 states have internal predecessors, (495), 0 states have call successors, (0), 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 01:33:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 495 transitions. [2023-11-29 01:33:31,753 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 495 transitions. Word has length 26 [2023-11-29 01:33:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:33:31,753 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 495 transitions. [2023-11-29 01:33:31,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 495 transitions. [2023-11-29 01:33:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 01:33:31,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:31,754 INFO L195 NwaCegarLoop]: trace histogram [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 01:33:31,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 01:33:31,754 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:33:31,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1727810161, now seen corresponding path program 1 times [2023-11-29 01:33:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:31,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127264813] [2023-11-29 01:33:31,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:32,307 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 01:33:32,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:32,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127264813] [2023-11-29 01:33:32,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127264813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:32,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:32,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 01:33:32,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483865983] [2023-11-29 01:33:32,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:32,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:33:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:32,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:33:32,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:33:32,309 INFO L87 Difference]: Start difference. First operand 336 states and 495 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:34,045 INFO L93 Difference]: Finished difference Result 460 states and 666 transitions. [2023-11-29 01:33:34,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:33:34,045 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 01:33:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:33:34,048 INFO L225 Difference]: With dead ends: 460 [2023-11-29 01:33:34,048 INFO L226 Difference]: Without dead ends: 460 [2023-11-29 01:33:34,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-11-29 01:33:34,049 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 238 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:33:34,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 855 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 01:33:34,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-11-29 01:33:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 336. [2023-11-29 01:33:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 289 states have (on average 1.7093425605536332) internal successors, (494), 335 states have internal predecessors, (494), 0 states have call successors, (0), 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 01:33:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 494 transitions. [2023-11-29 01:33:34,054 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 494 transitions. Word has length 26 [2023-11-29 01:33:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:33:34,054 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 494 transitions. [2023-11-29 01:33:34,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 494 transitions. [2023-11-29 01:33:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 01:33:34,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:34,055 INFO L195 NwaCegarLoop]: trace histogram [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 01:33:34,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 01:33:34,056 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:33:34,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:34,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1134609150, now seen corresponding path program 1 times [2023-11-29 01:33:34,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:34,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198382700] [2023-11-29 01:33:34,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:34,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:34,241 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 01:33:34,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:34,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198382700] [2023-11-29 01:33:34,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198382700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:34,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:34,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:33:34,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202513553] [2023-11-29 01:33:34,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:34,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:33:34,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:34,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:33:34,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:33:34,243 INFO L87 Difference]: Start difference. First operand 336 states and 494 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:34,747 INFO L93 Difference]: Finished difference Result 335 states and 493 transitions. [2023-11-29 01:33:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:33:34,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 01:33:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:33:34,751 INFO L225 Difference]: With dead ends: 335 [2023-11-29 01:33:34,751 INFO L226 Difference]: Without dead ends: 335 [2023-11-29 01:33:34,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:33:34,751 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:33:34,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 311 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:33:34,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-11-29 01:33:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2023-11-29 01:33:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 289 states have (on average 1.7058823529411764) internal successors, (493), 334 states have internal predecessors, (493), 0 states have call successors, (0), 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 01:33:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 493 transitions. [2023-11-29 01:33:34,757 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 493 transitions. Word has length 26 [2023-11-29 01:33:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:33:34,757 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 493 transitions. [2023-11-29 01:33:34,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 493 transitions. [2023-11-29 01:33:34,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 01:33:34,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:34,758 INFO L195 NwaCegarLoop]: trace histogram [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 01:33:34,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 01:33:34,758 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:33:34,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:34,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1134609151, now seen corresponding path program 1 times [2023-11-29 01:33:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:34,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494726525] [2023-11-29 01:33:34,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:34,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:34,904 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 01:33:34,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:34,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494726525] [2023-11-29 01:33:34,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494726525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:34,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:34,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:33:34,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858298519] [2023-11-29 01:33:34,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:34,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:33:34,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:34,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:33:34,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:33:34,906 INFO L87 Difference]: Start difference. First operand 335 states and 493 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:35,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:35,326 INFO L93 Difference]: Finished difference Result 334 states and 492 transitions. [2023-11-29 01:33:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:33:35,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 01:33:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:33:35,328 INFO L225 Difference]: With dead ends: 334 [2023-11-29 01:33:35,329 INFO L226 Difference]: Without dead ends: 334 [2023-11-29 01:33:35,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:33:35,329 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:33:35,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 341 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:33:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-11-29 01:33:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2023-11-29 01:33:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 289 states have (on average 1.7024221453287198) internal successors, (492), 333 states have internal predecessors, (492), 0 states have call successors, (0), 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 01:33:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 492 transitions. [2023-11-29 01:33:35,336 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 492 transitions. Word has length 26 [2023-11-29 01:33:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:33:35,336 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 492 transitions. [2023-11-29 01:33:35,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 492 transitions. [2023-11-29 01:33:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 01:33:35,337 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:35,337 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, 1, 1] [2023-11-29 01:33:35,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 01:33:35,337 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:33:35,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1278331082, now seen corresponding path program 1 times [2023-11-29 01:33:35,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:35,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222339512] [2023-11-29 01:33:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:33:36,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:36,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222339512] [2023-11-29 01:33:36,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222339512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:33:36,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748092694] [2023-11-29 01:33:36,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:36,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:33:36,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:33:36,022 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:33:36,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:33:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:36,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 01:33:36,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:33:36,169 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 01:33:36,218 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 01:33:36,231 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 01:33:36,306 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:33:36,306 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 01:33:36,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 01:33:36,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 01:33:36,424 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 30 treesize of output 21 [2023-11-29 01:33:36,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 01:33:36,706 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:33:36,707 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 55 treesize of output 48 [2023-11-29 01:33:36,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-11-29 01:33:36,785 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:33:36,785 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 01:33:36,918 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 22 [2023-11-29 01:33:36,923 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 01:33:37,109 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:33:37,109 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 55 treesize of output 48 [2023-11-29 01:33:37,115 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 16 [2023-11-29 01:33:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:33:37,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:33:37,573 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1380 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1381 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1381) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) is different from false [2023-11-29 01:33:37,589 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) (and (forall ((v_ArrVal_1380 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1380) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1381 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1381) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))) is different from false [2023-11-29 01:33:38,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:38,472 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 118 treesize of output 136 [2023-11-29 01:33:38,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (and (forall ((v_prenex_105 Int) (v_prenex_107 (Array Int Int)) (v_ArrVal_1374 Int) (v_ArrVal_1378 (Array Int Int)) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_prenex_106 (Array Int Int))) (or (= v_prenex_105 |c_ULTIMATE.start_main_~tree~0#1.base|) (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0 v_ArrVal_1374)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1376) v_prenex_105 v_ArrVal_1378) (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_107) v_prenex_105 v_prenex_106) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_1381) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_41| Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (= (select (select (let ((.cse2 (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1377) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_1379))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_1380)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_41| |c_ULTIMATE.start_main_~tree~0#1.base|)))))) is different from false [2023-11-29 01:33:39,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:39,249 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 3 case distinctions, treesize of input 64 treesize of output 57 [2023-11-29 01:33:39,253 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:33:39,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:39,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 94 [2023-11-29 01:33:39,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:39,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-11-29 01:33:39,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-29 01:33:39,303 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-29 01:33:39,303 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 3 case distinctions, treesize of input 64 treesize of output 1 [2023-11-29 01:33:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:33:39,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748092694] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:33:39,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:33:39,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 30 [2023-11-29 01:33:39,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525877116] [2023-11-29 01:33:39,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:33:39,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 01:33:39,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:39,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 01:33:39,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=567, Unknown=27, NotChecked=156, Total=870 [2023-11-29 01:33:39,398 INFO L87 Difference]: Start difference. First operand 334 states and 492 transitions. Second operand has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:43,908 INFO L93 Difference]: Finished difference Result 490 states and 698 transitions. [2023-11-29 01:33:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 01:33:43,908 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 01:33:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:33:43,911 INFO L225 Difference]: With dead ends: 490 [2023-11-29 01:33:43,911 INFO L226 Difference]: Without dead ends: 490 [2023-11-29 01:33:43,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=295, Invalid=1090, Unknown=33, NotChecked=222, Total=1640 [2023-11-29 01:33:43,913 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 387 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 753 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:33:43,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 2001 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1740 Invalid, 0 Unknown, 753 Unchecked, 3.5s Time] [2023-11-29 01:33:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2023-11-29 01:33:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 339. [2023-11-29 01:33:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 294 states have (on average 1.6904761904761905) internal successors, (497), 338 states have internal predecessors, (497), 0 states have call successors, (0), 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 01:33:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 497 transitions. [2023-11-29 01:33:43,919 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 497 transitions. Word has length 27 [2023-11-29 01:33:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:33:43,919 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 497 transitions. [2023-11-29 01:33:43,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 497 transitions. [2023-11-29 01:33:43,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 01:33:43,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:43,920 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, 1, 1, 1] [2023-11-29 01:33:43,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 01:33:44,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:33:44,120 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:33:44,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash 140565563, now seen corresponding path program 1 times [2023-11-29 01:33:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:44,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720287777] [2023-11-29 01:33:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:33:44,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:44,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720287777] [2023-11-29 01:33:44,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720287777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:33:44,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196212955] [2023-11-29 01:33:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:44,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:33:44,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:33:44,942 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:33:44,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:33:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:45,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 01:33:45,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:33:45,098 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 01:33:45,125 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:33:45,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 01:33:45,188 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 01:33:45,372 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:33:45,372 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 25 treesize of output 26 [2023-11-29 01:33:45,418 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:33:45,419 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 01:33:45,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-29 01:33:45,669 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:33:45,669 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 01:33:45,952 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 01:33:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:33:45,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:33:46,070 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-11-29 01:33:46,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 01:33:46,079 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1470 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1470) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem11#1.base|)) is different from false [2023-11-29 01:33:46,149 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1469)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1470) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) .cse1)))) is different from false [2023-11-29 01:33:46,262 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_42| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1468) |v_ULTIMATE.start_main_~tmpList~0#1.base_42| v_ArrVal_1469)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1470) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) .cse1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_42|) 0)))) is different from false [2023-11-29 01:33:46,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:46,385 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 72 treesize of output 53 [2023-11-29 01:33:46,389 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:33:46,393 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 364 treesize of output 274 [2023-11-29 01:33:46,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 20 treesize of output 12 [2023-11-29 01:33:46,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 01:33:46,423 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 01:33:46,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-29 01:33:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:33:46,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196212955] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:33:46,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:33:46,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 11] total 32 [2023-11-29 01:33:46,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796687569] [2023-11-29 01:33:46,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:33:46,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 01:33:46,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:46,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 01:33:46,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=806, Unknown=7, NotChecked=180, Total=1122 [2023-11-29 01:33:46,541 INFO L87 Difference]: Start difference. First operand 339 states and 497 transitions. Second operand has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 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 01:33:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:50,196 INFO L93 Difference]: Finished difference Result 482 states and 690 transitions. [2023-11-29 01:33:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 01:33:50,196 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 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 28 [2023-11-29 01:33:50,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:33:50,199 INFO L225 Difference]: With dead ends: 482 [2023-11-29 01:33:50,199 INFO L226 Difference]: Without dead ends: 482 [2023-11-29 01:33:50,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=331, Invalid=1744, Unknown=7, NotChecked=270, Total=2352 [2023-11-29 01:33:50,200 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 572 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 887 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:33:50,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1546 Invalid, 2647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1686 Invalid, 0 Unknown, 887 Unchecked, 2.8s Time] [2023-11-29 01:33:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2023-11-29 01:33:50,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 343. [2023-11-29 01:33:50,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 298 states have (on average 1.6845637583892616) internal successors, (502), 342 states have internal predecessors, (502), 0 states have call successors, (0), 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 01:33:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 502 transitions. [2023-11-29 01:33:50,208 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 502 transitions. Word has length 28 [2023-11-29 01:33:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:33:50,208 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 502 transitions. [2023-11-29 01:33:50,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 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 01:33:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 502 transitions. [2023-11-29 01:33:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 01:33:50,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:50,209 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, 1, 1, 1] [2023-11-29 01:33:50,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 01:33:50,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:33:50,410 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:33:50,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash 140565564, now seen corresponding path program 1 times [2023-11-29 01:33:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:50,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569398931] [2023-11-29 01:33:50,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:50,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:33:51,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:51,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569398931] [2023-11-29 01:33:51,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569398931] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:33:51,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016188834] [2023-11-29 01:33:51,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:51,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:33:51,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:33:51,293 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:33:51,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 01:33:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:51,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 01:33:51,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:33:51,440 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 01:33:51,494 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:33:51,495 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 01:33:51,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:33:51,692 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:33:51,693 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 31 treesize of output 32 [2023-11-29 01:33:51,737 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:33:51,737 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 01:33:51,817 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 14 [2023-11-29 01:33:51,962 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:33:51,963 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 70 treesize of output 65 [2023-11-29 01:33:51,973 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 49 treesize of output 30 [2023-11-29 01:33:52,487 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:33:52,488 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-11-29 01:33:52,495 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:33:52,496 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 32 treesize of output 14 [2023-11-29 01:33:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:33:52,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:33:53,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:53,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 66 [2023-11-29 01:33:53,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:53,466 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 150 treesize of output 144 [2023-11-29 01:33:53,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 104 [2023-11-29 01:33:53,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2023-11-29 01:34:06,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:06,448 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 47 treesize of output 48 [2023-11-29 01:34:06,455 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 96 treesize of output 84 [2023-11-29 01:34:06,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2023-11-29 01:34:06,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2023-11-29 01:34:06,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:06,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2023-11-29 01:34:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:34:06,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016188834] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:34:06,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:34:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 34 [2023-11-29 01:34:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526594720] [2023-11-29 01:34:06,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:34:06,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 01:34:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:06,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 01:34:06,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1080, Unknown=4, NotChecked=0, Total=1260 [2023-11-29 01:34:06,787 INFO L87 Difference]: Start difference. First operand 343 states and 502 transitions. Second operand has 36 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 35 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:34:11,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:11,839 INFO L93 Difference]: Finished difference Result 486 states and 694 transitions. [2023-11-29 01:34:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:34:11,839 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 35 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 01:34:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:11,842 INFO L225 Difference]: With dead ends: 486 [2023-11-29 01:34:11,842 INFO L226 Difference]: Without dead ends: 486 [2023-11-29 01:34:11,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=329, Invalid=1737, Unknown=4, NotChecked=0, Total=2070 [2023-11-29 01:34:11,844 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 496 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:11,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1753 Invalid, 2368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-11-29 01:34:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-11-29 01:34:11,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 343. [2023-11-29 01:34:11,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 342 states have internal predecessors, (501), 0 states have call successors, (0), 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 01:34:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 501 transitions. [2023-11-29 01:34:11,852 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 501 transitions. Word has length 28 [2023-11-29 01:34:11,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:11,852 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 501 transitions. [2023-11-29 01:34:11,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 35 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:34:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 501 transitions. [2023-11-29 01:34:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 01:34:11,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:11,853 INFO L195 NwaCegarLoop]: trace histogram [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 01:34:11,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 01:34:12,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-11-29 01:34:12,054 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:34:12,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:12,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1511534071, now seen corresponding path program 1 times [2023-11-29 01:34:12,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:12,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103798771] [2023-11-29 01:34:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:12,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,109 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 01:34:12,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:12,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103798771] [2023-11-29 01:34:12,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103798771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:12,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:12,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:12,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444074032] [2023-11-29 01:34:12,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:12,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:34:12,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:12,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:34:12,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:34:12,111 INFO L87 Difference]: Start difference. First operand 343 states and 501 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:34:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:12,577 INFO L93 Difference]: Finished difference Result 484 states and 624 transitions. [2023-11-29 01:34:12,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:34:12,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:34:12,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:12,579 INFO L225 Difference]: With dead ends: 484 [2023-11-29 01:34:12,579 INFO L226 Difference]: Without dead ends: 484 [2023-11-29 01:34:12,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 01:34:12,580 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 287 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:12,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 286 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:34:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2023-11-29 01:34:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 363. [2023-11-29 01:34:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 318 states have (on average 1.6981132075471699) internal successors, (540), 362 states have internal predecessors, (540), 0 states have call successors, (0), 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 01:34:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 540 transitions. [2023-11-29 01:34:12,588 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 540 transitions. Word has length 28 [2023-11-29 01:34:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:12,589 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 540 transitions. [2023-11-29 01:34:12,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:34:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 540 transitions. [2023-11-29 01:34:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 01:34:12,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:12,590 INFO L195 NwaCegarLoop]: trace histogram [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 01:34:12,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-29 01:34:12,590 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:34:12,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:12,590 INFO L85 PathProgramCache]: Analyzing trace with hash -387083700, now seen corresponding path program 1 times [2023-11-29 01:34:12,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:12,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879935261] [2023-11-29 01:34:12,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:12,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:13,210 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 01:34:13,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:13,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879935261] [2023-11-29 01:34:13,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879935261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:13,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:13,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 01:34:13,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030926432] [2023-11-29 01:34:13,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:13,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 01:34:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:13,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:34:13,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:34:13,212 INFO L87 Difference]: Start difference. First operand 363 states and 540 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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 01:34:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:16,006 INFO L93 Difference]: Finished difference Result 629 states and 843 transitions. [2023-11-29 01:34:16,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 01:34:16,006 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 01:34:16,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:16,009 INFO L225 Difference]: With dead ends: 629 [2023-11-29 01:34:16,009 INFO L226 Difference]: Without dead ends: 629 [2023-11-29 01:34:16,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 01:34:16,010 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 720 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:16,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 479 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 01:34:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2023-11-29 01:34:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 387. [2023-11-29 01:34:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 342 states have (on average 1.695906432748538) internal successors, (580), 386 states have internal predecessors, (580), 0 states have call successors, (0), 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 01:34:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 580 transitions. [2023-11-29 01:34:16,017 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 580 transitions. Word has length 29 [2023-11-29 01:34:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:16,017 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 580 transitions. [2023-11-29 01:34:16,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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 01:34:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 580 transitions. [2023-11-29 01:34:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:34:16,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:16,017 INFO L195 NwaCegarLoop]: trace histogram [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 01:34:16,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-29 01:34:16,018 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:34:16,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:16,018 INFO L85 PathProgramCache]: Analyzing trace with hash -627891781, now seen corresponding path program 1 times [2023-11-29 01:34:16,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:16,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581519380] [2023-11-29 01:34:16,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:16,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,941 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 01:34:16,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:16,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581519380] [2023-11-29 01:34:16,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581519380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:16,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:16,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 01:34:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522395239] [2023-11-29 01:34:16,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:16,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 01:34:16,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:16,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 01:34:16,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:34:16,943 INFO L87 Difference]: Start difference. First operand 387 states and 580 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 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 01:34:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:18,883 INFO L93 Difference]: Finished difference Result 612 states and 875 transitions. [2023-11-29 01:34:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 01:34:18,884 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 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 01:34:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:18,887 INFO L225 Difference]: With dead ends: 612 [2023-11-29 01:34:18,887 INFO L226 Difference]: Without dead ends: 612 [2023-11-29 01:34:18,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2023-11-29 01:34:18,888 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 663 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:18,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 778 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 01:34:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2023-11-29 01:34:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 428. [2023-11-29 01:34:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 383 states have (on average 1.6866840731070496) internal successors, (646), 427 states have internal predecessors, (646), 0 states have call successors, (0), 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 01:34:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 646 transitions. [2023-11-29 01:34:18,896 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 646 transitions. Word has length 30 [2023-11-29 01:34:18,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:18,896 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 646 transitions. [2023-11-29 01:34:18,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 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 01:34:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 646 transitions. [2023-11-29 01:34:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:34:18,897 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:18,897 INFO L195 NwaCegarLoop]: trace histogram [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 01:34:18,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-29 01:34:18,897 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:34:18,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:18,898 INFO L85 PathProgramCache]: Analyzing trace with hash -627891780, now seen corresponding path program 1 times [2023-11-29 01:34:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:18,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968563172] [2023-11-29 01:34:18,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:18,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,038 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 01:34:20,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:20,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968563172] [2023-11-29 01:34:20,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968563172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:20,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:20,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 01:34:20,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852618490] [2023-11-29 01:34:20,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:20,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 01:34:20,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:20,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 01:34:20,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:34:20,040 INFO L87 Difference]: Start difference. First operand 428 states and 646 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 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 01:34:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:23,444 INFO L93 Difference]: Finished difference Result 660 states and 954 transitions. [2023-11-29 01:34:23,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:34:23,445 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 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 01:34:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:23,449 INFO L225 Difference]: With dead ends: 660 [2023-11-29 01:34:23,449 INFO L226 Difference]: Without dead ends: 660 [2023-11-29 01:34:23,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2023-11-29 01:34:23,449 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 558 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:23,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 926 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 01:34:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2023-11-29 01:34:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 478. [2023-11-29 01:34:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 433 states have (on average 1.6789838337182448) internal successors, (727), 477 states have internal predecessors, (727), 0 states have call successors, (0), 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 01:34:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 727 transitions. [2023-11-29 01:34:23,458 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 727 transitions. Word has length 30 [2023-11-29 01:34:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:23,458 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 727 transitions. [2023-11-29 01:34:23,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 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 01:34:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 727 transitions. [2023-11-29 01:34:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 01:34:23,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:23,459 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, 1, 1, 1, 1, 1, 1] [2023-11-29 01:34:23,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-11-29 01:34:23,459 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:34:23,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:23,459 INFO L85 PathProgramCache]: Analyzing trace with hash -4175101, now seen corresponding path program 1 times [2023-11-29 01:34:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084833338] [2023-11-29 01:34:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:23,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:34:24,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:24,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084833338] [2023-11-29 01:34:24,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084833338] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:34:24,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933136732] [2023-11-29 01:34:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:24,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:34:24,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:34:24,224 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:34:24,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 01:34:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:24,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 01:34:24,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:34:24,397 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 01:34:24,457 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:34:24,458 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 01:34:24,512 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 13 treesize of output 9 [2023-11-29 01:34:24,530 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 19 treesize of output 1 [2023-11-29 01:34:24,722 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:34:24,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2023-11-29 01:34:24,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 30 treesize of output 13 [2023-11-29 01:34:24,781 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:34:24,782 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 01:34:24,895 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 14 [2023-11-29 01:34:24,905 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 18 treesize of output 13 [2023-11-29 01:34:24,974 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 20 treesize of output 8 [2023-11-29 01:34:25,041 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 18 treesize of output 13 [2023-11-29 01:34:25,444 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:25,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:25,449 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 19 treesize of output 10 [2023-11-29 01:34:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:34:25,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:34:26,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:26,824 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 50 treesize of output 51 [2023-11-29 01:34:26,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:26,838 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 40 treesize of output 41 [2023-11-29 01:34:26,842 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:26,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2023-11-29 01:34:26,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:26,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:26,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 184 [2023-11-29 01:34:26,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2023-11-29 01:34:26,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-29 01:34:26,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-29 01:34:26,951 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 01:34:26,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-29 01:34:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:34:27,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933136732] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:34:27,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:34:27,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 13] total 36 [2023-11-29 01:34:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783296777] [2023-11-29 01:34:27,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:34:27,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 01:34:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:27,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 01:34:27,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1201, Unknown=33, NotChecked=0, Total=1406 [2023-11-29 01:34:27,174 INFO L87 Difference]: Start difference. First operand 478 states and 727 transitions. Second operand has 38 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:34:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:32,729 INFO L93 Difference]: Finished difference Result 615 states and 909 transitions. [2023-11-29 01:34:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 01:34:32,730 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 01:34:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:32,733 INFO L225 Difference]: With dead ends: 615 [2023-11-29 01:34:32,733 INFO L226 Difference]: Without dead ends: 615 [2023-11-29 01:34:32,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=417, Invalid=2305, Unknown=34, NotChecked=0, Total=2756 [2023-11-29 01:34:32,734 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 582 mSDsluCounter, 2389 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:32,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 2526 Invalid, 2553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-11-29 01:34:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2023-11-29 01:34:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 481. [2023-11-29 01:34:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 436 states have (on average 1.676605504587156) internal successors, (731), 480 states have internal predecessors, (731), 0 states have call successors, (0), 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 01:34:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 731 transitions. [2023-11-29 01:34:32,742 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 731 transitions. Word has length 31 [2023-11-29 01:34:32,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:32,742 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 731 transitions. [2023-11-29 01:34:32,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:34:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 731 transitions. [2023-11-29 01:34:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 01:34:32,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:32,743 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, 1, 1, 1, 1, 1, 1] [2023-11-29 01:34:32,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 01:34:32,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:34:32,943 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:34:32,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:32,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1674726515, now seen corresponding path program 1 times [2023-11-29 01:34:32,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:32,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015780762] [2023-11-29 01:34:32,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:32,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:32,985 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 01:34:32,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:32,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015780762] [2023-11-29 01:34:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015780762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:32,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:32,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:34:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364649463] [2023-11-29 01:34:32,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:32,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:32,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:32,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:32,987 INFO L87 Difference]: Start difference. First operand 481 states and 731 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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 01:34:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:33,111 INFO L93 Difference]: Finished difference Result 479 states and 686 transitions. [2023-11-29 01:34:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:33,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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 01:34:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:33,115 INFO L225 Difference]: With dead ends: 479 [2023-11-29 01:34:33,115 INFO L226 Difference]: Without dead ends: 479 [2023-11-29 01:34:33,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:33,116 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 31 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:33,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 226 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:34:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2023-11-29 01:34:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 460. [2023-11-29 01:34:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 415 states have (on average 1.653012048192771) internal successors, (686), 459 states have internal predecessors, (686), 0 states have call successors, (0), 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 01:34:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 686 transitions. [2023-11-29 01:34:33,123 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 686 transitions. Word has length 31 [2023-11-29 01:34:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:33,123 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 686 transitions. [2023-11-29 01:34:33,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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 01:34:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 686 transitions. [2023-11-29 01:34:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 01:34:33,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:33,124 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:34:33,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-11-29 01:34:33,124 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:34:33,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -129427784, now seen corresponding path program 1 times [2023-11-29 01:34:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:33,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80983644] [2023-11-29 01:34:33,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:34,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:34:34,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:34,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80983644] [2023-11-29 01:34:34,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80983644] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:34:34,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032525825] [2023-11-29 01:34:34,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:34,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:34:34,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:34:34,345 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:34:34,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 01:34:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:34,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 01:34:34,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:34:34,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 01:34:34,564 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:34:34,565 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 01:34:34,624 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 19 treesize of output 1 [2023-11-29 01:34:34,831 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:34:34,831 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 42 treesize of output 41 [2023-11-29 01:34:34,885 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:34:34,885 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 01:34:35,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2023-11-29 01:34:35,211 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:34:35,211 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 42 treesize of output 41 [2023-11-29 01:34:35,683 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:35,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:35,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2023-11-29 01:34:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:34:35,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:34:36,473 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_90| Int) (v_ArrVal_1958 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_90|) (< (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1958) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_90| 8)) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_90| 0))) is different from false [2023-11-29 01:34:36,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_90| Int) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_90|) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_90| 0) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1957))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1958)) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_90| 8)) |c_#StackHeapBarrier|))) is different from false [2023-11-29 01:34:36,749 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_90| Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_45| Int) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_90|) (< (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1956) |v_ULTIMATE.start_main_~tmpList~0#1.base_45| v_ArrVal_1957))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1958)) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_90| 8)) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_45|) 0)) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_90| 0))) is different from false [2023-11-29 01:34:36,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:36,997 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 50 treesize of output 41 [2023-11-29 01:34:37,001 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:37,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:37,020 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 278 treesize of output 232 [2023-11-29 01:34:37,044 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 01:34:37,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-29 01:34:37,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:37,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 67 [2023-11-29 01:34:37,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-29 01:34:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:34:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032525825] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:34:37,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:34:37,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 12] total 40 [2023-11-29 01:34:37,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512016969] [2023-11-29 01:34:37,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:34:37,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 01:34:37,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:37,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 01:34:37,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1279, Unknown=14, NotChecked=222, Total=1640 [2023-11-29 01:34:37,441 INFO L87 Difference]: Start difference. First operand 460 states and 686 transitions. Second operand has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 40 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:34:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:47,270 INFO L93 Difference]: Finished difference Result 594 states and 862 transitions. [2023-11-29 01:34:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-29 01:34:47,271 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 40 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 01:34:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:47,274 INFO L225 Difference]: With dead ends: 594 [2023-11-29 01:34:47,274 INFO L226 Difference]: Without dead ends: 592 [2023-11-29 01:34:47,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=675, Invalid=4293, Unknown=14, NotChecked=420, Total=5402 [2023-11-29 01:34:47,276 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 784 mSDsluCounter, 2248 mSDsCounter, 0 mSdLazyCounter, 3415 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 4414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 920 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:47,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 2360 Invalid, 4414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3415 Invalid, 0 Unknown, 920 Unchecked, 6.2s Time] [2023-11-29 01:34:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2023-11-29 01:34:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 458. [2023-11-29 01:34:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 413 states have (on average 1.6537530266343825) internal successors, (683), 457 states have internal predecessors, (683), 0 states have call successors, (0), 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 01:34:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 683 transitions. [2023-11-29 01:34:47,283 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 683 transitions. Word has length 32 [2023-11-29 01:34:47,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:47,283 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 683 transitions. [2023-11-29 01:34:47,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 40 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:34:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 683 transitions. [2023-11-29 01:34:47,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 01:34:47,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:47,283 INFO L195 NwaCegarLoop]: trace histogram [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 01:34:47,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 01:34:47,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:34:47,484 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:34:47,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:47,485 INFO L85 PathProgramCache]: Analyzing trace with hash 376916542, now seen corresponding path program 1 times [2023-11-29 01:34:47,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:47,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619535260] [2023-11-29 01:34:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:47,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:34:48,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619535260] [2023-11-29 01:34:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619535260] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:34:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015341246] [2023-11-29 01:34:48,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:48,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:34:48,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:34:48,912 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:34:48,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 01:34:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:49,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 01:34:49,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:34:49,287 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 01:34:49,499 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:34:49,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2023-11-29 01:34:49,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:49,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2023-11-29 01:34:50,628 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~tmp~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_#t~mem50#1.base_15| Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem50#1.base_15| 0) |ULTIMATE.start_main_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~tmp~0#1.base| 1) |v_ULTIMATE.start_main_#t~mem50#1.base_15|) 0))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~tmp~0#1.base|) 0))) is different from true [2023-11-29 01:34:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 01:34:50,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:34:51,258 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2022 (Array Int Int))) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2022) |c_ULTIMATE.start_main_~tree~0#1.base|) 8) 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-11-29 01:34:51,272 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2022 (Array Int Int))) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_2022) |c_ULTIMATE.start_main_~tree~0#1.base|) 8) 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-11-29 01:34:51,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:51,283 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 30 treesize of output 31 [2023-11-29 01:34:51,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:51,297 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 52 treesize of output 50 [2023-11-29 01:34:51,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 17 [2023-11-29 01:35:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:01,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015341246] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:35:01,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:35:01,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 37 [2023-11-29 01:35:01,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22024341] [2023-11-29 01:35:01,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:35:01,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 01:35:01,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:01,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 01:35:01,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1165, Unknown=3, NotChecked=210, Total=1482 [2023-11-29 01:35:01,334 INFO L87 Difference]: Start difference. First operand 458 states and 683 transitions. Second operand has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 38 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 01:35:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:07,519 INFO L93 Difference]: Finished difference Result 468 states and 693 transitions. [2023-11-29 01:35:07,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:35:07,519 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 38 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 32 [2023-11-29 01:35:07,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:07,522 INFO L225 Difference]: With dead ends: 468 [2023-11-29 01:35:07,522 INFO L226 Difference]: Without dead ends: 447 [2023-11-29 01:35:07,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=261, Invalid=2004, Unknown=3, NotChecked=282, Total=2550 [2023-11-29 01:35:07,523 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 186 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 416 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:07,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1730 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2356 Invalid, 1 Unknown, 416 Unchecked, 4.5s Time] [2023-11-29 01:35:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-11-29 01:35:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2023-11-29 01:35:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 400 states have (on average 1.6725) internal successors, (669), 444 states have internal predecessors, (669), 0 states have call successors, (0), 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 01:35:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 669 transitions. [2023-11-29 01:35:07,529 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 669 transitions. Word has length 32 [2023-11-29 01:35:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:07,529 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 669 transitions. [2023-11-29 01:35:07,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 38 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 01:35:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 669 transitions. [2023-11-29 01:35:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 01:35:07,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:07,530 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:07,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 01:35:07,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-11-29 01:35:07,731 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:07,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:07,731 INFO L85 PathProgramCache]: Analyzing trace with hash 283805889, now seen corresponding path program 1 times [2023-11-29 01:35:07,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:07,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832360250] [2023-11-29 01:35:07,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832360250] [2023-11-29 01:35:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832360250] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:35:08,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187394159] [2023-11-29 01:35:08,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:08,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:35:08,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:35:08,480 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:35:08,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 01:35:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:08,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 01:35:08,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:08,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:35:08,731 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:35:08,731 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 01:35:08,791 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 01:35:08,959 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:35:08,959 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 25 treesize of output 26 [2023-11-29 01:35:09,016 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:35:09,017 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 01:35:09,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-29 01:35:09,308 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2023-11-29 01:35:09,308 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 93 treesize of output 67 [2023-11-29 01:35:09,314 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 50 treesize of output 35 [2023-11-29 01:35:09,799 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 41 treesize of output 29 [2023-11-29 01:35:09,903 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 01:35:09,903 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 20 [2023-11-29 01:35:09,981 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 01:35:09,982 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:09,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187394159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:09,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:35:09,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 23 [2023-11-29 01:35:09,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233958817] [2023-11-29 01:35:09,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:09,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:35:09,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:09,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:35:09,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2023-11-29 01:35:09,984 INFO L87 Difference]: Start difference. First operand 445 states and 669 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:35:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:12,536 INFO L93 Difference]: Finished difference Result 687 states and 985 transitions. [2023-11-29 01:35:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:35:12,536 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:35:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:12,540 INFO L225 Difference]: With dead ends: 687 [2023-11-29 01:35:12,540 INFO L226 Difference]: Without dead ends: 687 [2023-11-29 01:35:12,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2023-11-29 01:35:12,541 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 329 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:12,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1116 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 01:35:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-11-29 01:35:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 449. [2023-11-29 01:35:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 404 states have (on average 1.6683168316831682) internal successors, (674), 448 states have internal predecessors, (674), 0 states have call successors, (0), 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 01:35:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 674 transitions. [2023-11-29 01:35:12,548 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 674 transitions. Word has length 33 [2023-11-29 01:35:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:12,548 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 674 transitions. [2023-11-29 01:35:12,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:35:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 674 transitions. [2023-11-29 01:35:12,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 01:35:12,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:12,549 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:12,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 01:35:12,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-11-29 01:35:12,750 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:12,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash 283805890, now seen corresponding path program 1 times [2023-11-29 01:35:12,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:12,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627022644] [2023-11-29 01:35:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:14,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:14,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627022644] [2023-11-29 01:35:14,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627022644] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:35:14,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726772533] [2023-11-29 01:35:14,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:14,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:35:14,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:35:14,457 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:35:14,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be03c969-edd9-4b7c-b2f2-7116f8c1a136/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 01:35:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:14,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-29 01:35:14,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:14,638 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 01:35:14,720 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:35:14,720 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 01:35:14,794 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 01:35:14,803 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 01:35:15,128 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:35:15,128 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 44 treesize of output 41 [2023-11-29 01:35:15,133 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 27 treesize of output 22 [2023-11-29 01:35:15,279 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:35:15,279 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 01:35:15,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 01:35:15,699 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 01:35:15,699 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 01:35:16,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 61 [2023-11-29 01:35:16,103 INFO L349 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2023-11-29 01:35:16,104 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 3 case distinctions, treesize of input 49 treesize of output 50 [2023-11-29 01:35:17,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:17,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2023-11-29 01:35:17,689 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-11-29 01:35:17,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 16 [2023-11-29 01:35:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:17,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:35:19,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:19,057 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 671 treesize of output 621 [2023-11-29 01:35:19,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 61 [2023-11-29 01:35:19,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:35:19,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 162 [2023-11-29 01:35:19,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:35:19,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:19,646 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1071 treesize of output 783 [2023-11-29 01:35:25,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:25,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 3025 treesize of output 3171 [2023-11-29 01:37:48,133 WARN L293 SmtUtils]: Spent 1.08m on a formula simplification. DAG size of input: 1029 DAG size of output: 462 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 01:37:48,134 INFO L349 Elim1Store]: treesize reduction 10716, result has 19.6 percent of original size [2023-11-29 01:37:48,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 123 case distinctions, treesize of input 217067 treesize of output 182451 [2023-11-29 01:37:58,305 WARN L293 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 1675 DAG size of output: 1113 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:38:00,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:38:00,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25055 treesize of output 18582 [2023-11-29 01:38:13,961 WARN L293 SmtUtils]: Spent 10.53s on a formula simplification. DAG size of input: 1192 DAG size of output: 1341 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:38:16,500 INFO L224 Elim1Store]: Index analysis took 812 ms [2023-11-29 01:38:22,534 WARN L293 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 422 DAG size of output: 104 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 01:38:22,535 INFO L349 Elim1Store]: treesize reduction 2624, result has 10.0 percent of original size [2023-11-29 01:38:22,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 47 case distinctions, treesize of input 22129 treesize of output 22289 [2023-11-29 01:38:24,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21936 treesize of output 21529 [2023-11-29 01:38:39,550 WARN L293 SmtUtils]: Spent 9.10s on a formula simplification. DAG size of input: 1295 DAG size of output: 1311 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:38:54,739 WARN L293 SmtUtils]: Spent 9.47s on a formula simplification. DAG size of input: 1284 DAG size of output: 1488 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:38:55,300 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:38:55,301 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:38:55,301 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:38:55,304 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:38:55,304 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:38:55,312 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:38:55,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:38:55,319 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:38:55,320 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:38:55,339 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:38:55,628 INFO L224 Elim1Store]: Index analysis took 130 ms [2023-11-29 01:39:12,002 WARN L293 SmtUtils]: Spent 16.35s on a formula simplification. DAG size of input: 860 DAG size of output: 250 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 01:39:12,002 INFO L349 Elim1Store]: treesize reduction 5680, result has 10.3 percent of original size [2023-11-29 01:39:12,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 11 select indices, 11 select index equivalence classes, 5 disjoint index pairs (out of 55 index pairs), introduced 16 new quantified variables, introduced 137 case distinctions, treesize of input 76817 treesize of output 76333 [2023-11-29 01:39:14,684 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:39:14,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3157 treesize of output 3099 [2023-11-29 01:39:16,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3250 treesize of output 2938 [2023-11-29 01:39:16,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3255 treesize of output 2967 [2023-11-29 01:39:18,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:39:18,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1818 treesize of output 1832 [2023-11-29 01:39:20,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2527 treesize of output 2311 [2023-11-29 01:39:20,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1859 treesize of output 1855 [2023-11-29 01:39:22,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:39:22,156 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 2258 treesize of output 2058 [2023-11-29 01:39:22,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2278 treesize of output 2050 [2023-11-29 01:39:34,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-11-29 01:39:34,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-11-29 01:39:34,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-11-29 01:39:36,649 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:39:37,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 01:39:40,780 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:39:42,047 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:39:44,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 01:39:44,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:39:44,385 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:39:44,387 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 62 [2023-11-29 01:39:50,789 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:39:57,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-11-29 01:39:57,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-11-29 01:39:57,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-11-29 01:39:58,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-11-29 01:39:58,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:39:58,772 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:39:58,773 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-29 01:40:10,044 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:40:10,263 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:40:11,042 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:40:11,107 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:40:28,245 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:40:28,410 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:40:28,472 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:40:28,553 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:40:28,674 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:40:34,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:40:34,255 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:40:34,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 72 [2023-11-29 01:40:34,630 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:40:34,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 80 [2023-11-29 01:40:35,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:40:35,159 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:40:35,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 72 [2023-11-29 01:40:35,448 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:40:35,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 80 [2023-11-29 01:40:35,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:40:35,814 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:40:35,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 72 [2023-11-29 01:40:36,833 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:40:36,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 80 [2023-11-29 01:40:37,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:40:37,079 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:40:37,270 INFO L349 Elim1Store]: treesize reduction 55, result has 38.2 percent of original size [2023-11-29 01:40:37,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 80 treesize of output 95 [2023-11-29 01:40:37,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:40:37,836 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:40:37,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 72 [2023-11-29 01:40:38,320 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:40:38,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 80 [2023-11-29 01:40:41,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:40:41,150 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:40:41,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 72 [2023-11-29 01:40:42,998 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:40:42,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 80 [2023-11-29 01:40:44,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:40:44,073 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:40:44,292 INFO L349 Elim1Store]: treesize reduction 45, result has 49.4 percent of original size [2023-11-29 01:40:44,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 80 treesize of output 105 [2023-11-29 01:40:44,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:40:44,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:40:45,109 INFO L349 Elim1Store]: treesize reduction 45, result has 49.4 percent of original size [2023-11-29 01:40:45,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 80 treesize of output 105 [2023-11-29 01:40:47,768 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:40:47,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 80 [2023-11-29 01:40:47,988 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:40:48,470 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:40:48,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 80 [2023-11-29 01:40:49,807 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:40:49,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 80 [2023-11-29 01:40:50,683 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:40:50,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 80 [2023-11-29 01:40:51,220 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:40:51,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 80 [2023-11-29 01:40:52,040 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:40:52,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 80 [2023-11-29 01:40:53,525 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 01:40:53,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 80 [2023-11-29 01:41:00,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:41:00,073 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 93 treesize of output 95 [2023-11-29 01:41:00,717 INFO L349 Elim1Store]: treesize reduction 52, result has 63.1 percent of original size [2023-11-29 01:41:00,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 208 treesize of output 274 [2023-11-29 01:41:08,489 INFO L349 Elim1Store]: treesize reduction 44, result has 68.8 percent of original size [2023-11-29 01:41:08,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 227 treesize of output 299 [2023-11-29 01:41:10,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:41:10,033 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 103 treesize of output 111 [2023-11-29 01:41:10,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:41:10,415 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 103 treesize of output 111 [2023-11-29 01:41:12,185 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 01:41:12,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 1 [2023-11-29 01:41:12,700 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 01:41:12,700 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 136 treesize of output 1 [2023-11-29 01:41:14,863 INFO L349 Elim1Store]: treesize reduction 140, result has 0.7 percent of original size [2023-11-29 01:41:14,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 162 treesize of output 1 [2023-11-29 01:41:15,701 INFO L349 Elim1Store]: treesize reduction 101, result has 28.4 percent of original size [2023-11-29 01:41:15,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 157 treesize of output 176 [2023-11-29 01:41:26,013 INFO L349 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-11-29 01:41:26,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 187 treesize of output 1 [2023-11-29 01:41:28,207 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:41:29,879 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:41:31,325 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:41:32,898 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:41:35,768 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:41:37,961 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:37,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:37,976 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 105 treesize of output 87 [2023-11-29 01:41:39,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:39,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:39,063 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 105 treesize of output 87 [2023-11-29 01:41:39,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:39,490 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:39,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 87 [2023-11-29 01:41:40,019 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:40,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:40,035 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 105 treesize of output 87 [2023-11-29 01:41:40,408 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:40,423 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:40,424 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 105 treesize of output 87 [2023-11-29 01:41:40,703 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:40,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:40,718 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 105 treesize of output 87 [2023-11-29 01:41:41,066 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:41,079 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:41,080 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 105 treesize of output 87 [2023-11-29 01:41:41,336 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:41,350 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:41,351 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 105 treesize of output 87 [2023-11-29 01:41:43,175 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 329 treesize of output 309 [2023-11-29 01:41:44,316 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 269 treesize of output 255 [2023-11-29 01:41:45,042 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 329 treesize of output 309 [2023-11-29 01:41:47,071 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 329 treesize of output 309 [2023-11-29 01:41:49,208 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:49,229 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:49,230 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 45 treesize of output 33 [2023-11-29 01:41:49,919 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 134 treesize of output 120 [2023-11-29 01:41:50,398 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:50,416 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:50,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 45 treesize of output 33 [2023-11-29 01:41:50,688 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:50,705 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:50,706 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 115 treesize of output 95 [2023-11-29 01:41:50,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:50,804 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:50,805 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 115 treesize of output 95 [2023-11-29 01:41:51,057 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:51,076 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:51,077 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 105 treesize of output 87 [2023-11-29 01:41:51,232 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:51,252 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:51,253 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 105 treesize of output 87 [2023-11-29 01:41:51,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:51,395 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:51,396 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 105 treesize of output 87 [2023-11-29 01:41:51,456 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:51,480 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:51,481 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 45 treesize of output 33 [2023-11-29 01:41:51,923 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:51,951 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:41:51,952 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 105 treesize of output 87