./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:49:46,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:49:46,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:49:46,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:49:46,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:49:46,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:49:46,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:49:46,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:49:46,694 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:49:46,695 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:49:46,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:49:46,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:49:46,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:49:46,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:49:46,698 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:49:46,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:49:46,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:49:46,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:49:46,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:49:46,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:49:46,699 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:49:46,699 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:49:46,700 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:49:46,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:49:46,703 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:49:46,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:49:46,703 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:49:46,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:49:46,703 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:49:46,704 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:49:46,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:49:46,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:49:46,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:49:46,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:49:46,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:49:46,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:49:46,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:49:46,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:49:46,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:49:46,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:49:46,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:49:46,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:49:46,706 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-17 02:49:46,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:49:46,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:49:46,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:49:46,930 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:49:46,930 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:49:46,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i [2024-11-17 02:49:48,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:49:48,391 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:49:48,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i [2024-11-17 02:49:48,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea25f6875/52ac4b818a1245f78229eb8e1f141f0b/FLAG4f56ae70e [2024-11-17 02:49:48,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea25f6875/52ac4b818a1245f78229eb8e1f141f0b [2024-11-17 02:49:48,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:49:48,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:49:48,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:49:48,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:49:48,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:49:48,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:49:48" (1/1) ... [2024-11-17 02:49:48,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41209028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:48, skipping insertion in model container [2024-11-17 02:49:48,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:49:48" (1/1) ... [2024-11-17 02:49:48,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:49:49,160 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:49:49,192 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:49:49,195 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:49:49,197 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:49:49,204 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:49:49,227 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:49:49,230 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:49:49,231 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:49:49,235 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:49:49,246 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:49:49,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:49:49,266 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:49:49,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:49:49,442 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:49:49,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49 WrapperNode [2024-11-17 02:49:49,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:49:49,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:49:49,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:49:49,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:49:49,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (1/1) ... [2024-11-17 02:49:49,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (1/1) ... [2024-11-17 02:49:49,548 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1529 [2024-11-17 02:49:49,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:49:49,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:49:49,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:49:49,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:49:49,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (1/1) ... [2024-11-17 02:49:49,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (1/1) ... [2024-11-17 02:49:49,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (1/1) ... [2024-11-17 02:49:49,656 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-17 02:49:49,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (1/1) ... [2024-11-17 02:49:49,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (1/1) ... [2024-11-17 02:49:49,694 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (1/1) ... [2024-11-17 02:49:49,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (1/1) ... [2024-11-17 02:49:49,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (1/1) ... [2024-11-17 02:49:49,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (1/1) ... [2024-11-17 02:49:49,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:49:49,718 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:49:49,718 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:49:49,718 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:49:49,719 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (1/1) ... [2024-11-17 02:49:49,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:49:49,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:49:49,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 02:49:49,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 02:49:49,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 02:49:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 02:49:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 02:49:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 02:49:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 02:49:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 02:49:49,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 02:49:49,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 02:49:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:49:49,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:49:49,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:49:49,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:49:49,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:49:49,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:49:49,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:49:49,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 02:49:49,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 02:49:49,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:49:49,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:49:50,013 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:49:50,016 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:49:51,882 INFO L? ?]: Removed 1493 outVars from TransFormulas that were not future-live. [2024-11-17 02:49:51,882 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:49:51,944 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:49:51,944 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-17 02:49:51,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:49:51 BoogieIcfgContainer [2024-11-17 02:49:51,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:49:51,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:49:51,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:49:51,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:49:51,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:49:48" (1/3) ... [2024-11-17 02:49:51,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103f5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:49:51, skipping insertion in model container [2024-11-17 02:49:51,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:49" (2/3) ... [2024-11-17 02:49:51,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103f5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:49:51, skipping insertion in model container [2024-11-17 02:49:51,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:49:51" (3/3) ... [2024-11-17 02:49:51,954 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test4-1.i [2024-11-17 02:49:51,968 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:49:51,969 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-17 02:49:52,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:49:52,038 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@656141c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:49:52,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-17 02:49:52,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 1456 states, 826 states have (on average 2.046004842615012) internal successors, (1690), 1448 states have internal predecessors, (1690), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:49:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 02:49:52,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:52,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 02:49:52,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:49:52,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1697619408, now seen corresponding path program 1 times [2024-11-17 02:49:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076422902] [2024-11-17 02:49:52,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:52,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:49:52,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:52,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076422902] [2024-11-17 02:49:52,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076422902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:52,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:52,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:49:52,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160158874] [2024-11-17 02:49:52,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:52,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:49:52,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:52,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:49:52,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:52,228 INFO L87 Difference]: Start difference. First operand has 1456 states, 826 states have (on average 2.046004842615012) internal successors, (1690), 1448 states have internal predecessors, (1690), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:53,001 INFO L93 Difference]: Finished difference Result 1462 states and 1642 transitions. [2024-11-17 02:49:53,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:49:53,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-17 02:49:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:53,016 INFO L225 Difference]: With dead ends: 1462 [2024-11-17 02:49:53,016 INFO L226 Difference]: Without dead ends: 1456 [2024-11-17 02:49:53,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:53,019 INFO L432 NwaCegarLoop]: 1559 mSDtfsCounter, 29 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:53,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2502 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:49:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2024-11-17 02:49:53,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1447. [2024-11-17 02:49:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 828 states have (on average 1.9565217391304348) internal successors, (1620), 1439 states have internal predecessors, (1620), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:49:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1632 transitions. [2024-11-17 02:49:53,109 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1632 transitions. Word has length 5 [2024-11-17 02:49:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:53,109 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1632 transitions. [2024-11-17 02:49:53,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1632 transitions. [2024-11-17 02:49:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 02:49:53,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:53,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:53,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 02:49:53,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:49:53,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:53,111 INFO L85 PathProgramCache]: Analyzing trace with hash -620279345, now seen corresponding path program 1 times [2024-11-17 02:49:53,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:53,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862062918] [2024-11-17 02:49:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:53,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:49:53,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:53,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862062918] [2024-11-17 02:49:53,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862062918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:53,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:53,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:49:53,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227076291] [2024-11-17 02:49:53,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:53,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:49:53,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:53,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:49:53,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:53,200 INFO L87 Difference]: Start difference. First operand 1447 states and 1632 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2024-11-17 02:49:53,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:53,877 INFO L93 Difference]: Finished difference Result 1353 states and 1536 transitions. [2024-11-17 02:49:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:49:53,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 [2024-11-17 02:49:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:53,881 INFO L225 Difference]: With dead ends: 1353 [2024-11-17 02:49:53,881 INFO L226 Difference]: Without dead ends: 1353 [2024-11-17 02:49:53,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:53,882 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 1372 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:53,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 868 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:49:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-17 02:49:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2024-11-17 02:49:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 828 states have (on average 1.8405797101449275) internal successors, (1524), 1345 states have internal predecessors, (1524), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:49:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1536 transitions. [2024-11-17 02:49:53,901 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1536 transitions. Word has length 7 [2024-11-17 02:49:53,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:53,901 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1536 transitions. [2024-11-17 02:49:53,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2024-11-17 02:49:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1536 transitions. [2024-11-17 02:49:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 02:49:53,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:53,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:53,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 02:49:53,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr627REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:49:53,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:53,903 INFO L85 PathProgramCache]: Analyzing trace with hash -620279344, now seen corresponding path program 1 times [2024-11-17 02:49:53,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:53,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101364401] [2024-11-17 02:49:53,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:53,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:49:54,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:54,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101364401] [2024-11-17 02:49:54,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101364401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:54,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:54,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:49:54,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743283886] [2024-11-17 02:49:54,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:54,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:49:54,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:54,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:49:54,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:54,023 INFO L87 Difference]: Start difference. First operand 1353 states and 1536 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2024-11-17 02:49:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:54,864 INFO L93 Difference]: Finished difference Result 1777 states and 2038 transitions. [2024-11-17 02:49:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:49:54,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 [2024-11-17 02:49:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:54,870 INFO L225 Difference]: With dead ends: 1777 [2024-11-17 02:49:54,870 INFO L226 Difference]: Without dead ends: 1777 [2024-11-17 02:49:54,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:54,871 INFO L432 NwaCegarLoop]: 1226 mSDtfsCounter, 831 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:54,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1841 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:49:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2024-11-17 02:49:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1623. [2024-11-17 02:49:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1108 states have (on average 1.80956678700361) internal successors, (2005), 1615 states have internal predecessors, (2005), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:49:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2017 transitions. [2024-11-17 02:49:54,901 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2017 transitions. Word has length 7 [2024-11-17 02:49:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:54,901 INFO L471 AbstractCegarLoop]: Abstraction has 1623 states and 2017 transitions. [2024-11-17 02:49:54,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2024-11-17 02:49:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2017 transitions. [2024-11-17 02:49:54,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:49:54,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:54,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:54,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 02:49:54,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:49:54,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash 858095659, now seen corresponding path program 1 times [2024-11-17 02:49:54,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:54,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620747755] [2024-11-17 02:49:54,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:49:54,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:54,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620747755] [2024-11-17 02:49:54,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620747755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:54,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:54,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:49:54,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061488002] [2024-11-17 02:49:54,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:54,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:54,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:54,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:54,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:54,965 INFO L87 Difference]: Start difference. First operand 1623 states and 2017 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:55,324 INFO L93 Difference]: Finished difference Result 2691 states and 3382 transitions. [2024-11-17 02:49:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:49:55,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-17 02:49:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:55,331 INFO L225 Difference]: With dead ends: 2691 [2024-11-17 02:49:55,331 INFO L226 Difference]: Without dead ends: 2688 [2024-11-17 02:49:55,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:55,336 INFO L432 NwaCegarLoop]: 1458 mSDtfsCounter, 1008 mSDsluCounter, 2681 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 4139 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:55,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 4139 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 02:49:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2024-11-17 02:49:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2389. [2024-11-17 02:49:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 1874 states have (on average 1.7934898612593384) internal successors, (3361), 2378 states have internal predecessors, (3361), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:49:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3379 transitions. [2024-11-17 02:49:55,372 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3379 transitions. Word has length 9 [2024-11-17 02:49:55,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:55,373 INFO L471 AbstractCegarLoop]: Abstraction has 2389 states and 3379 transitions. [2024-11-17 02:49:55,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3379 transitions. [2024-11-17 02:49:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 02:49:55,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:55,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:55,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 02:49:55,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr622REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:49:55,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:55,375 INFO L85 PathProgramCache]: Analyzing trace with hash -131339220, now seen corresponding path program 1 times [2024-11-17 02:49:55,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:55,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198708017] [2024-11-17 02:49:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:49:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:55,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198708017] [2024-11-17 02:49:55,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198708017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:55,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:55,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:49:55,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111925842] [2024-11-17 02:49:55,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:55,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:55,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:55,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:55,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:55,437 INFO L87 Difference]: Start difference. First operand 2389 states and 3379 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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) [2024-11-17 02:49:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:56,283 INFO L93 Difference]: Finished difference Result 2464 states and 3485 transitions. [2024-11-17 02:49:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:49:56,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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 [2024-11-17 02:49:56,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:56,290 INFO L225 Difference]: With dead ends: 2464 [2024-11-17 02:49:56,291 INFO L226 Difference]: Without dead ends: 2464 [2024-11-17 02:49:56,291 INFO L431 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 [2024-11-17 02:49:56,291 INFO L432 NwaCegarLoop]: 832 mSDtfsCounter, 1640 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:56,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 1535 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:49:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2024-11-17 02:49:56,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2366. [2024-11-17 02:49:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 1874 states have (on average 1.7689434364994663) internal successors, (3315), 2355 states have internal predecessors, (3315), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:49:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3333 transitions. [2024-11-17 02:49:56,328 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3333 transitions. Word has length 14 [2024-11-17 02:49:56,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:56,328 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3333 transitions. [2024-11-17 02:49:56,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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) [2024-11-17 02:49:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3333 transitions. [2024-11-17 02:49:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 02:49:56,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:56,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:56,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 02:49:56,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr623REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:49:56,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash -131339219, now seen corresponding path program 1 times [2024-11-17 02:49:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564657000] [2024-11-17 02:49:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:49:56,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564657000] [2024-11-17 02:49:56,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564657000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:56,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:56,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:49:56,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123210473] [2024-11-17 02:49:56,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:56,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:56,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:56,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:56,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:56,459 INFO L87 Difference]: Start difference. First operand 2366 states and 3333 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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) [2024-11-17 02:49:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:57,557 INFO L93 Difference]: Finished difference Result 2836 states and 3804 transitions. [2024-11-17 02:49:57,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:49:57,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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 [2024-11-17 02:49:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:57,565 INFO L225 Difference]: With dead ends: 2836 [2024-11-17 02:49:57,565 INFO L226 Difference]: Without dead ends: 2836 [2024-11-17 02:49:57,565 INFO L431 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 [2024-11-17 02:49:57,567 INFO L432 NwaCegarLoop]: 1294 mSDtfsCounter, 1245 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:57,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 2791 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 02:49:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2836 states. [2024-11-17 02:49:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2836 to 2484. [2024-11-17 02:49:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2484 states, 1992 states have (on average 1.7354417670682731) internal successors, (3457), 2473 states have internal predecessors, (3457), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:49:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3475 transitions. [2024-11-17 02:49:57,603 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3475 transitions. Word has length 14 [2024-11-17 02:49:57,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:57,603 INFO L471 AbstractCegarLoop]: Abstraction has 2484 states and 3475 transitions. [2024-11-17 02:49:57,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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) [2024-11-17 02:49:57,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3475 transitions. [2024-11-17 02:49:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 02:49:57,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:57,605 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:57,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 02:49:57,605 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr623REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:49:57,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash 549338573, now seen corresponding path program 1 times [2024-11-17 02:49:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:57,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194115047] [2024-11-17 02:49:57,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 02:49:57,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:57,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194115047] [2024-11-17 02:49:57,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194115047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:57,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:57,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:49:57,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138094753] [2024-11-17 02:49:57,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:57,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:49:57,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:57,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:49:57,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:57,794 INFO L87 Difference]: Start difference. First operand 2484 states and 3475 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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) [2024-11-17 02:49:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:57,862 INFO L93 Difference]: Finished difference Result 2217 states and 3105 transitions. [2024-11-17 02:49:57,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:49:57,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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 52 [2024-11-17 02:49:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:57,868 INFO L225 Difference]: With dead ends: 2217 [2024-11-17 02:49:57,868 INFO L226 Difference]: Without dead ends: 2217 [2024-11-17 02:49:57,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:57,870 INFO L432 NwaCegarLoop]: 1320 mSDtfsCounter, 51 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:57,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 2596 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:49:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2024-11-17 02:49:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2024-11-17 02:49:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1748 states have (on average 1.7660183066361557) internal successors, (3087), 2206 states have internal predecessors, (3087), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:49:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3105 transitions. [2024-11-17 02:49:57,895 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3105 transitions. Word has length 52 [2024-11-17 02:49:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:57,895 INFO L471 AbstractCegarLoop]: Abstraction has 2217 states and 3105 transitions. [2024-11-17 02:49:57,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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) [2024-11-17 02:49:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3105 transitions. [2024-11-17 02:49:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-17 02:49:57,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:57,896 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:57,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 02:49:57,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr570REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:49:57,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:57,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1452084582, now seen corresponding path program 1 times [2024-11-17 02:49:57,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:57,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372357009] [2024-11-17 02:49:57,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:57,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:49:57,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:57,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372357009] [2024-11-17 02:49:57,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372357009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:57,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:57,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:49:57,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293802338] [2024-11-17 02:49:57,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:57,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:57,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:57,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:57,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:57,980 INFO L87 Difference]: Start difference. First operand 2217 states and 3105 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:58,104 INFO L93 Difference]: Finished difference Result 2243 states and 3123 transitions. [2024-11-17 02:49:58,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:49:58,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-17 02:49:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:58,110 INFO L225 Difference]: With dead ends: 2243 [2024-11-17 02:49:58,110 INFO L226 Difference]: Without dead ends: 2243 [2024-11-17 02:49:58,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:49:58,111 INFO L432 NwaCegarLoop]: 1312 mSDtfsCounter, 56 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3862 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:58,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3862 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:49:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2024-11-17 02:49:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2241. [2024-11-17 02:49:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1772 states have (on average 1.7511286681715577) internal successors, (3103), 2230 states have internal predecessors, (3103), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:49:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3121 transitions. [2024-11-17 02:49:58,135 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3121 transitions. Word has length 65 [2024-11-17 02:49:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:58,136 INFO L471 AbstractCegarLoop]: Abstraction has 2241 states and 3121 transitions. [2024-11-17 02:49:58,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3121 transitions. [2024-11-17 02:49:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 02:49:58,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:58,137 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:58,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 02:49:58,138 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr570REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:49:58,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2117113826, now seen corresponding path program 1 times [2024-11-17 02:49:58,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:58,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672421328] [2024-11-17 02:49:58,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:49:58,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:58,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672421328] [2024-11-17 02:49:58,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672421328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:58,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:58,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:49:58,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686870984] [2024-11-17 02:49:58,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:58,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:49:58,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:58,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:49:58,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:58,218 INFO L87 Difference]: Start difference. First operand 2241 states and 3121 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:58,298 INFO L93 Difference]: Finished difference Result 2005 states and 2713 transitions. [2024-11-17 02:49:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:49:58,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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 73 [2024-11-17 02:49:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:58,304 INFO L225 Difference]: With dead ends: 2005 [2024-11-17 02:49:58,304 INFO L226 Difference]: Without dead ends: 2005 [2024-11-17 02:49:58,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:58,305 INFO L432 NwaCegarLoop]: 1327 mSDtfsCounter, 75 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:58,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 2626 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:49:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2024-11-17 02:49:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 2005. [2024-11-17 02:49:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1536 states have (on average 1.7545572916666667) internal successors, (2695), 1994 states have internal predecessors, (2695), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:49:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2713 transitions. [2024-11-17 02:49:58,327 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2713 transitions. Word has length 73 [2024-11-17 02:49:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:58,327 INFO L471 AbstractCegarLoop]: Abstraction has 2005 states and 2713 transitions. [2024-11-17 02:49:58,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2713 transitions. [2024-11-17 02:49:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-17 02:49:58,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:58,328 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:58,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 02:49:58,328 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr541REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:49:58,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash 655748320, now seen corresponding path program 1 times [2024-11-17 02:49:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:58,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621636618] [2024-11-17 02:49:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:58,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:49:58,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:58,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621636618] [2024-11-17 02:49:58,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621636618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:58,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:58,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 02:49:58,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163279608] [2024-11-17 02:49:58,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:58,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:49:58,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:58,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:49:58,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:49:58,725 INFO L87 Difference]: Start difference. First operand 2005 states and 2713 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:59,726 INFO L93 Difference]: Finished difference Result 1921 states and 2588 transitions. [2024-11-17 02:49:59,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:49:59,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-17 02:49:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:59,731 INFO L225 Difference]: With dead ends: 1921 [2024-11-17 02:49:59,732 INFO L226 Difference]: Without dead ends: 1921 [2024-11-17 02:49:59,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:49:59,732 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 2310 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2164 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:59,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 1577 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2164 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 02:49:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2024-11-17 02:49:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1641. [2024-11-17 02:49:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1256 states have (on average 1.6552547770700636) internal successors, (2079), 1630 states have internal predecessors, (2079), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:49:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2097 transitions. [2024-11-17 02:49:59,749 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2097 transitions. Word has length 76 [2024-11-17 02:49:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:59,749 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2097 transitions. [2024-11-17 02:49:59,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2097 transitions. [2024-11-17 02:49:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-17 02:49:59,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:59,750 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:59,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 02:49:59,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:49:59,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2106872745, now seen corresponding path program 1 times [2024-11-17 02:49:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:59,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177743234] [2024-11-17 02:49:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:49:59,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:59,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177743234] [2024-11-17 02:49:59,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177743234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:59,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:59,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:49:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810814037] [2024-11-17 02:49:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:59,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:49:59,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:59,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:49:59,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:49:59,945 INFO L87 Difference]: Start difference. First operand 1641 states and 2097 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:50:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:00,679 INFO L93 Difference]: Finished difference Result 1640 states and 2095 transitions. [2024-11-17 02:50:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:50:00,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-17 02:50:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:00,684 INFO L225 Difference]: With dead ends: 1640 [2024-11-17 02:50:00,684 INFO L226 Difference]: Without dead ends: 1640 [2024-11-17 02:50:00,685 INFO L431 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 [2024-11-17 02:50:00,685 INFO L432 NwaCegarLoop]: 1239 mSDtfsCounter, 2 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:00,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3469 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:50:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-17 02:50:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2024-11-17 02:50:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1256 states have (on average 1.6536624203821657) internal successors, (2077), 1629 states have internal predecessors, (2077), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:50:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2095 transitions. [2024-11-17 02:50:00,702 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2095 transitions. Word has length 81 [2024-11-17 02:50:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:00,702 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2095 transitions. [2024-11-17 02:50:00,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:50:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2095 transitions. [2024-11-17 02:50:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-17 02:50:00,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:00,703 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:00,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 02:50:00,704 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr535REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:00,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:00,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2106872746, now seen corresponding path program 1 times [2024-11-17 02:50:00,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:00,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096423318] [2024-11-17 02:50:00,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:00,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:01,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:01,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096423318] [2024-11-17 02:50:01,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096423318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:01,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:01,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:50:01,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710345728] [2024-11-17 02:50:01,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:01,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:50:01,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:01,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:50:01,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:50:01,030 INFO L87 Difference]: Start difference. First operand 1640 states and 2095 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:50:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:01,930 INFO L93 Difference]: Finished difference Result 1639 states and 2093 transitions. [2024-11-17 02:50:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:50:01,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-17 02:50:01,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:01,934 INFO L225 Difference]: With dead ends: 1639 [2024-11-17 02:50:01,934 INFO L226 Difference]: Without dead ends: 1639 [2024-11-17 02:50:01,934 INFO L431 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 [2024-11-17 02:50:01,935 INFO L432 NwaCegarLoop]: 1239 mSDtfsCounter, 1 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3490 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:01,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3490 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 02:50:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-17 02:50:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1639. [2024-11-17 02:50:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1254 states have (on average 1.6547049441786283) internal successors, (2075), 1628 states have internal predecessors, (2075), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:50:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2093 transitions. [2024-11-17 02:50:01,951 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2093 transitions. Word has length 81 [2024-11-17 02:50:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:01,952 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2093 transitions. [2024-11-17 02:50:01,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:50:01,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2093 transitions. [2024-11-17 02:50:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-17 02:50:01,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:01,953 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:01,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 02:50:01,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:01,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:01,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1350926054, now seen corresponding path program 1 times [2024-11-17 02:50:01,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:01,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389108982] [2024-11-17 02:50:01,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:01,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:02,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:02,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:02,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389108982] [2024-11-17 02:50:02,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389108982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:02,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:02,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:50:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663010837] [2024-11-17 02:50:02,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:02,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:50:02,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:02,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:50:02,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:50:02,202 INFO L87 Difference]: Start difference. First operand 1639 states and 2093 transitions. Second operand has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:03,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:03,329 INFO L93 Difference]: Finished difference Result 1657 states and 2123 transitions. [2024-11-17 02:50:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 02:50:03,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-17 02:50:03,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:03,335 INFO L225 Difference]: With dead ends: 1657 [2024-11-17 02:50:03,335 INFO L226 Difference]: Without dead ends: 1657 [2024-11-17 02:50:03,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-17 02:50:03,336 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 10 mSDsluCounter, 4162 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:03,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5390 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:50:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-11-17 02:50:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1648. [2024-11-17 02:50:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1262 states have (on average 1.6529318541996831) internal successors, (2086), 1635 states have internal predecessors, (2086), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-17 02:50:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2113 transitions. [2024-11-17 02:50:03,355 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2113 transitions. Word has length 89 [2024-11-17 02:50:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:03,355 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2113 transitions. [2024-11-17 02:50:03,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2113 transitions. [2024-11-17 02:50:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-17 02:50:03,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:03,356 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:03,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 02:50:03,356 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr531REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:03,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:03,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1350926055, now seen corresponding path program 1 times [2024-11-17 02:50:03,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:03,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537090236] [2024-11-17 02:50:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:03,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:03,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:03,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:03,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537090236] [2024-11-17 02:50:03,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537090236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:03,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:03,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:50:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729691347] [2024-11-17 02:50:03,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:03,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:50:03,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:50:03,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:50:03,733 INFO L87 Difference]: Start difference. First operand 1648 states and 2113 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:04,688 INFO L93 Difference]: Finished difference Result 1648 states and 2111 transitions. [2024-11-17 02:50:04,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:50:04,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-17 02:50:04,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:04,692 INFO L225 Difference]: With dead ends: 1648 [2024-11-17 02:50:04,692 INFO L226 Difference]: Without dead ends: 1648 [2024-11-17 02:50:04,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 02:50:04,692 INFO L432 NwaCegarLoop]: 1235 mSDtfsCounter, 5 mSDsluCounter, 3277 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4512 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:04,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4512 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 02:50:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-17 02:50:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2024-11-17 02:50:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1262 states have (on average 1.6513470681458002) internal successors, (2084), 1635 states have internal predecessors, (2084), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-17 02:50:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2111 transitions. [2024-11-17 02:50:04,710 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2111 transitions. Word has length 89 [2024-11-17 02:50:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:04,710 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2111 transitions. [2024-11-17 02:50:04,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2111 transitions. [2024-11-17 02:50:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-17 02:50:04,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:04,711 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:04,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 02:50:04,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:04,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:04,712 INFO L85 PathProgramCache]: Analyzing trace with hash 639547670, now seen corresponding path program 1 times [2024-11-17 02:50:04,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:04,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550256656] [2024-11-17 02:50:04,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:04,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:05,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:05,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:05,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550256656] [2024-11-17 02:50:05,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550256656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:05,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822927983] [2024-11-17 02:50:05,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:05,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:05,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:05,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:50:05,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 02:50:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:05,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 02:50:05,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:05,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:50:05,395 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:50:05,396 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 [2024-11-17 02:50:05,411 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 [2024-11-17 02:50:05,474 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:05,474 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 [2024-11-17 02:50:05,502 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 [2024-11-17 02:50:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:05,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:05,540 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-17 02:50:05,541 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 [2024-11-17 02:50:05,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822927983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:05,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:05,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-17 02:50:05,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475767527] [2024-11-17 02:50:05,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:05,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 02:50:05,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:05,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 02:50:05,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=196, Unknown=6, NotChecked=0, Total=240 [2024-11-17 02:50:05,579 INFO L87 Difference]: Start difference. First operand 1648 states and 2111 transitions. Second operand has 15 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:50:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:07,553 INFO L93 Difference]: Finished difference Result 1647 states and 2109 transitions. [2024-11-17 02:50:07,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:50:07,555 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-11-17 02:50:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:07,558 INFO L225 Difference]: With dead ends: 1647 [2024-11-17 02:50:07,558 INFO L226 Difference]: Without dead ends: 1647 [2024-11-17 02:50:07,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=452, Unknown=7, NotChecked=0, Total=552 [2024-11-17 02:50:07,560 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1194 mSDsluCounter, 5764 mSDsCounter, 0 mSdLazyCounter, 4896 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 6511 SdHoareTripleChecker+Invalid, 4922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:07,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 6511 Invalid, 4922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4896 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 02:50:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-11-17 02:50:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2024-11-17 02:50:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1262 states have (on average 1.6497622820919176) internal successors, (2082), 1634 states have internal predecessors, (2082), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-17 02:50:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2109 transitions. [2024-11-17 02:50:07,590 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2109 transitions. Word has length 90 [2024-11-17 02:50:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:07,590 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2109 transitions. [2024-11-17 02:50:07,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:50:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2109 transitions. [2024-11-17 02:50:07,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-17 02:50:07,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:07,591 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:07,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 02:50:07,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-17 02:50:07,796 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr531REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:07,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash 639547671, now seen corresponding path program 1 times [2024-11-17 02:50:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:07,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522352847] [2024-11-17 02:50:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:08,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:08,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:08,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522352847] [2024-11-17 02:50:08,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522352847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:08,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17165170] [2024-11-17 02:50:08,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:08,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:08,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:08,353 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:50:08,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 02:50:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:08,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-17 02:50:08,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:08,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:50:08,641 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:50:08,641 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 [2024-11-17 02:50:08,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 02:50:08,671 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 [2024-11-17 02:50:08,676 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 [2024-11-17 02:50:08,755 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 22 treesize of output 10 [2024-11-17 02:50:08,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:50:08,847 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:08,848 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 62 treesize of output 57 [2024-11-17 02:50:08,852 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 [2024-11-17 02:50:08,891 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 [2024-11-17 02:50:08,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:50:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:08,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:08,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_628 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 02:50:08,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17165170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:08,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:08,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-17 02:50:08,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519514416] [2024-11-17 02:50:08,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:08,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 02:50:08,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:08,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 02:50:08,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-17 02:50:08,993 INFO L87 Difference]: Start difference. First operand 1647 states and 2109 transitions. Second operand has 19 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:50:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:11,050 INFO L93 Difference]: Finished difference Result 1654 states and 2115 transitions. [2024-11-17 02:50:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:50:11,051 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 90 [2024-11-17 02:50:11,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:11,054 INFO L225 Difference]: With dead ends: 1654 [2024-11-17 02:50:11,054 INFO L226 Difference]: Without dead ends: 1654 [2024-11-17 02:50:11,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-17 02:50:11,055 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1233 mSDsluCounter, 4190 mSDsCounter, 0 mSdLazyCounter, 5245 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 4942 SdHoareTripleChecker+Invalid, 5276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:11,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 4942 Invalid, 5276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5245 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:50:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2024-11-17 02:50:11,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1642. [2024-11-17 02:50:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1258 states have (on average 1.6502384737678855) internal successors, (2076), 1630 states have internal predecessors, (2076), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:50:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2094 transitions. [2024-11-17 02:50:11,069 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2094 transitions. Word has length 90 [2024-11-17 02:50:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:11,069 INFO L471 AbstractCegarLoop]: Abstraction has 1642 states and 2094 transitions. [2024-11-17 02:50:11,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:50:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2094 transitions. [2024-11-17 02:50:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-17 02:50:11,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:11,071 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:11,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 02:50:11,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-17 02:50:11,272 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:11,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1595807953, now seen corresponding path program 1 times [2024-11-17 02:50:11,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:11,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672484866] [2024-11-17 02:50:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:11,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:11,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672484866] [2024-11-17 02:50:11,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672484866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:11,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:11,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:50:11,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719399405] [2024-11-17 02:50:11,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:11,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:50:11,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:11,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:50:11,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:50:11,653 INFO L87 Difference]: Start difference. First operand 1642 states and 2094 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:13,159 INFO L93 Difference]: Finished difference Result 1661 states and 2123 transitions. [2024-11-17 02:50:13,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:50:13,159 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-17 02:50:13,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:13,162 INFO L225 Difference]: With dead ends: 1661 [2024-11-17 02:50:13,162 INFO L226 Difference]: Without dead ends: 1661 [2024-11-17 02:50:13,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-17 02:50:13,164 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1262 mSDsluCounter, 5084 mSDsCounter, 0 mSdLazyCounter, 4371 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 5830 SdHoareTripleChecker+Invalid, 4392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:13,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 5830 Invalid, 4392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4371 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:50:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2024-11-17 02:50:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1657. [2024-11-17 02:50:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1272 states have (on average 1.645440251572327) internal successors, (2093), 1643 states have internal predecessors, (2093), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-17 02:50:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2113 transitions. [2024-11-17 02:50:13,179 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2113 transitions. Word has length 92 [2024-11-17 02:50:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:13,179 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2113 transitions. [2024-11-17 02:50:13,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2113 transitions. [2024-11-17 02:50:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-17 02:50:13,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:13,180 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:13,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 02:50:13,180 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:13,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:13,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1595807954, now seen corresponding path program 1 times [2024-11-17 02:50:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:13,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638690054] [2024-11-17 02:50:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:13,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:13,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:13,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:13,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638690054] [2024-11-17 02:50:13,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638690054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:13,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:13,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 02:50:13,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670621111] [2024-11-17 02:50:13,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:13,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 02:50:13,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:13,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 02:50:13,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-17 02:50:13,638 INFO L87 Difference]: Start difference. First operand 1657 states and 2113 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:15,730 INFO L93 Difference]: Finished difference Result 1660 states and 2121 transitions. [2024-11-17 02:50:15,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 02:50:15,730 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-17 02:50:15,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:15,733 INFO L225 Difference]: With dead ends: 1660 [2024-11-17 02:50:15,733 INFO L226 Difference]: Without dead ends: 1660 [2024-11-17 02:50:15,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-17 02:50:15,735 INFO L432 NwaCegarLoop]: 753 mSDtfsCounter, 1216 mSDsluCounter, 4926 mSDsCounter, 0 mSdLazyCounter, 5767 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 5679 SdHoareTripleChecker+Invalid, 5786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:15,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 5679 Invalid, 5786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5767 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 02:50:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-11-17 02:50:15,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1657. [2024-11-17 02:50:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1272 states have (on average 1.6438679245283019) internal successors, (2091), 1643 states have internal predecessors, (2091), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-17 02:50:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2111 transitions. [2024-11-17 02:50:15,749 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2111 transitions. Word has length 92 [2024-11-17 02:50:15,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:15,749 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2111 transitions. [2024-11-17 02:50:15,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:15,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2111 transitions. [2024-11-17 02:50:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-17 02:50:15,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:15,750 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:15,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 02:50:15,750 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:15,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash 291008673, now seen corresponding path program 1 times [2024-11-17 02:50:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:15,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96569949] [2024-11-17 02:50:15,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:16,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:16,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:16,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96569949] [2024-11-17 02:50:16,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96569949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:16,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355344691] [2024-11-17 02:50:16,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:16,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:16,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:16,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:50:16,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 02:50:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:16,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 02:50:16,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:16,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:50:16,417 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:50:16,418 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 [2024-11-17 02:50:16,423 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 [2024-11-17 02:50:16,470 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:16,471 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 [2024-11-17 02:50:16,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:16,506 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 [2024-11-17 02:50:16,517 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 [2024-11-17 02:50:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:16,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:16,527 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_884) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-17 02:50:16,585 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-17 02:50:16,585 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 33 treesize of output 32 [2024-11-17 02:50:16,599 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_887))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_884)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-17 02:50:16,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355344691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:16,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:16,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-17 02:50:16,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383783241] [2024-11-17 02:50:16,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:16,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 02:50:16,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:16,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 02:50:16,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=252, Unknown=10, NotChecked=66, Total=380 [2024-11-17 02:50:16,604 INFO L87 Difference]: Start difference. First operand 1657 states and 2111 transitions. Second operand has 17 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:18,604 INFO L93 Difference]: Finished difference Result 1659 states and 2119 transitions. [2024-11-17 02:50:18,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:50:18,608 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-17 02:50:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:18,611 INFO L225 Difference]: With dead ends: 1659 [2024-11-17 02:50:18,611 INFO L226 Difference]: Without dead ends: 1659 [2024-11-17 02:50:18,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=536, Unknown=10, NotChecked=98, Total=756 [2024-11-17 02:50:18,611 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1188 mSDsluCounter, 7214 mSDsCounter, 0 mSdLazyCounter, 5971 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 7960 SdHoareTripleChecker+Invalid, 5991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:18,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 7960 Invalid, 5991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5971 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:50:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-11-17 02:50:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1656. [2024-11-17 02:50:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1272 states have (on average 1.6422955974842768) internal successors, (2089), 1642 states have internal predecessors, (2089), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-17 02:50:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2109 transitions. [2024-11-17 02:50:18,628 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2109 transitions. Word has length 93 [2024-11-17 02:50:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:18,629 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2109 transitions. [2024-11-17 02:50:18,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2109 transitions. [2024-11-17 02:50:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-17 02:50:18,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:18,632 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:18,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 02:50:18,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:18,833 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:18,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash 291008674, now seen corresponding path program 1 times [2024-11-17 02:50:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:18,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707684262] [2024-11-17 02:50:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:19,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:19,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:19,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707684262] [2024-11-17 02:50:19,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707684262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:19,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47183551] [2024-11-17 02:50:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:19,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:19,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:19,374 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:50:19,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 02:50:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:19,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 02:50:19,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:19,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:50:19,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 02:50:19,643 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:50:19,644 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 [2024-11-17 02:50:19,668 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 [2024-11-17 02:50:19,673 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 [2024-11-17 02:50:19,732 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 22 treesize of output 10 [2024-11-17 02:50:19,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:50:19,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:19,840 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 62 treesize of output 57 [2024-11-17 02:50:19,843 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 [2024-11-17 02:50:19,906 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:19,907 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 62 treesize of output 57 [2024-11-17 02:50:19,910 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 [2024-11-17 02:50:19,924 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 [2024-11-17 02:50:19,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:50:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:19,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:20,024 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1031 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1031 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-17 02:50:20,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1031 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1036))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1037) .cse0 v_ArrVal_1031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1037) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-17 02:50:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47183551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:20,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:20,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-17 02:50:20,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971405560] [2024-11-17 02:50:20,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:20,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 02:50:20,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:20,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 02:50:20,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=468, Unknown=12, NotChecked=90, Total=650 [2024-11-17 02:50:20,062 INFO L87 Difference]: Start difference. First operand 1656 states and 2109 transitions. Second operand has 21 states, 18 states have (on average 8.11111111111111) internal successors, (146), 20 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:50:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:22,825 INFO L93 Difference]: Finished difference Result 1658 states and 2117 transitions. [2024-11-17 02:50:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:50:22,825 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.11111111111111) internal successors, (146), 20 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2024-11-17 02:50:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:22,828 INFO L225 Difference]: With dead ends: 1658 [2024-11-17 02:50:22,828 INFO L226 Difference]: Without dead ends: 1658 [2024-11-17 02:50:22,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=735, Unknown=12, NotChecked=114, Total=992 [2024-11-17 02:50:22,830 INFO L432 NwaCegarLoop]: 751 mSDtfsCounter, 1210 mSDsluCounter, 6037 mSDsCounter, 0 mSdLazyCounter, 7205 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 6788 SdHoareTripleChecker+Invalid, 7230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:22,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 6788 Invalid, 7230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7205 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-17 02:50:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2024-11-17 02:50:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1640. [2024-11-17 02:50:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1258 states have (on average 1.6470588235294117) internal successors, (2072), 1628 states have internal predecessors, (2072), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:50:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2090 transitions. [2024-11-17 02:50:22,846 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2090 transitions. Word has length 93 [2024-11-17 02:50:22,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:22,846 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2090 transitions. [2024-11-17 02:50:22,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.11111111111111) internal successors, (146), 20 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:50:22,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2090 transitions. [2024-11-17 02:50:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 02:50:22,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:22,847 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:22,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 02:50:23,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:23,047 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:23,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash -276981793, now seen corresponding path program 1 times [2024-11-17 02:50:23,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:23,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540428962] [2024-11-17 02:50:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:23,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:23,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:23,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:23,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540428962] [2024-11-17 02:50:23,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540428962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:23,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:23,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-17 02:50:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224280117] [2024-11-17 02:50:23,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:23,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 02:50:23,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:23,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 02:50:23,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-17 02:50:23,487 INFO L87 Difference]: Start difference. First operand 1640 states and 2090 transitions. Second operand has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:25,558 INFO L93 Difference]: Finished difference Result 1665 states and 2125 transitions. [2024-11-17 02:50:25,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:50:25,558 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-17 02:50:25,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:25,561 INFO L225 Difference]: With dead ends: 1665 [2024-11-17 02:50:25,561 INFO L226 Difference]: Without dead ends: 1665 [2024-11-17 02:50:25,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-17 02:50:25,562 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1219 mSDsluCounter, 7249 mSDsCounter, 0 mSdLazyCounter, 6003 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 7994 SdHoareTripleChecker+Invalid, 6023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:25,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 7994 Invalid, 6023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 6003 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:50:25,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2024-11-17 02:50:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1661. [2024-11-17 02:50:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1278 states have (on average 1.6392801251956182) internal successors, (2095), 1647 states have internal predecessors, (2095), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-17 02:50:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2115 transitions. [2024-11-17 02:50:25,573 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2115 transitions. Word has length 95 [2024-11-17 02:50:25,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:25,573 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2115 transitions. [2024-11-17 02:50:25,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2115 transitions. [2024-11-17 02:50:25,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 02:50:25,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:25,574 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:25,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 02:50:25,574 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:25,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:25,574 INFO L85 PathProgramCache]: Analyzing trace with hash -276981792, now seen corresponding path program 1 times [2024-11-17 02:50:25,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:25,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834026422] [2024-11-17 02:50:25,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:25,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:26,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834026422] [2024-11-17 02:50:26,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834026422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:26,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:26,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 02:50:26,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323601006] [2024-11-17 02:50:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:26,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 02:50:26,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:26,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 02:50:26,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-17 02:50:26,176 INFO L87 Difference]: Start difference. First operand 1661 states and 2115 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:27,863 INFO L93 Difference]: Finished difference Result 1664 states and 2123 transitions. [2024-11-17 02:50:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:50:27,863 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-17 02:50:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:27,865 INFO L225 Difference]: With dead ends: 1664 [2024-11-17 02:50:27,866 INFO L226 Difference]: Without dead ends: 1664 [2024-11-17 02:50:27,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-17 02:50:27,866 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1197 mSDsluCounter, 4519 mSDsCounter, 0 mSdLazyCounter, 4861 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 5271 SdHoareTripleChecker+Invalid, 4880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:27,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 5271 Invalid, 4880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4861 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 02:50:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2024-11-17 02:50:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1661. [2024-11-17 02:50:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1278 states have (on average 1.637715179968701) internal successors, (2093), 1647 states have internal predecessors, (2093), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-17 02:50:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2113 transitions. [2024-11-17 02:50:27,881 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2113 transitions. Word has length 95 [2024-11-17 02:50:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:27,881 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2113 transitions. [2024-11-17 02:50:27,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2113 transitions. [2024-11-17 02:50:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 02:50:27,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:27,882 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:27,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 02:50:27,882 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:27,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:27,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2098303473, now seen corresponding path program 1 times [2024-11-17 02:50:27,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:27,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865436756] [2024-11-17 02:50:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:27,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:28,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:28,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865436756] [2024-11-17 02:50:28,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865436756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:28,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363771830] [2024-11-17 02:50:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:28,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:28,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:28,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:50:28,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 02:50:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:28,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 02:50:28,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:28,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:50:28,554 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:50:28,555 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 [2024-11-17 02:50:28,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:50:28,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:28,610 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 [2024-11-17 02:50:28,638 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:28,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 42 treesize of output 41 [2024-11-17 02:50:28,667 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:28,667 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 [2024-11-17 02:50:28,674 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 [2024-11-17 02:50:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:28,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:32,823 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-17 02:50:32,824 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 57 treesize of output 56 [2024-11-17 02:50:32,828 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1317 (Array Int Int)) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1320 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1320))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1316)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1317)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-17 02:50:32,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363771830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:32,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:32,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2024-11-17 02:50:32,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214422576] [2024-11-17 02:50:32,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:32,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-17 02:50:32,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:32,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 02:50:32,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=449, Unknown=29, NotChecked=44, Total=600 [2024-11-17 02:50:32,831 INFO L87 Difference]: Start difference. First operand 1661 states and 2113 transitions. Second operand has 20 states, 18 states have (on average 8.0) internal successors, (144), 19 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:50:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:35,354 INFO L93 Difference]: Finished difference Result 1663 states and 2121 transitions. [2024-11-17 02:50:35,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:50:35,355 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 19 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-17 02:50:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:35,357 INFO L225 Difference]: With dead ends: 1663 [2024-11-17 02:50:35,357 INFO L226 Difference]: Without dead ends: 1663 [2024-11-17 02:50:35,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=157, Invalid=869, Unknown=34, NotChecked=62, Total=1122 [2024-11-17 02:50:35,358 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1186 mSDsluCounter, 7208 mSDsCounter, 0 mSdLazyCounter, 5973 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 7953 SdHoareTripleChecker+Invalid, 6004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:35,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 7953 Invalid, 6004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5973 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-17 02:50:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-11-17 02:50:35,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1660. [2024-11-17 02:50:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1278 states have (on average 1.636150234741784) internal successors, (2091), 1646 states have internal predecessors, (2091), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-17 02:50:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2111 transitions. [2024-11-17 02:50:35,370 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2111 transitions. Word has length 96 [2024-11-17 02:50:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:35,371 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 2111 transitions. [2024-11-17 02:50:35,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 19 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:50:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2111 transitions. [2024-11-17 02:50:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 02:50:35,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:35,371 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:35,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 02:50:35,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-17 02:50:35,572 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:35,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2098303472, now seen corresponding path program 1 times [2024-11-17 02:50:35,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:35,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944156740] [2024-11-17 02:50:35,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:35,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:36,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:36,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:36,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944156740] [2024-11-17 02:50:36,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944156740] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:36,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123031476] [2024-11-17 02:50:36,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:36,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:36,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:36,198 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:50:36,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 02:50:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:36,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-17 02:50:36,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:36,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:50:36,508 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:50:36,509 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 [2024-11-17 02:50:36,529 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 [2024-11-17 02:50:36,603 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:36,603 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 [2024-11-17 02:50:36,639 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:36,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 70 treesize of output 65 [2024-11-17 02:50:36,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 40 treesize of output 23 [2024-11-17 02:50:36,705 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:36,705 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 [2024-11-17 02:50:36,708 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 51 treesize of output 32 [2024-11-17 02:50:36,746 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 [2024-11-17 02:50:36,749 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 34 treesize of output 16 [2024-11-17 02:50:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:36,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:36,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 02:50:36,929 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 84 treesize of output 88 [2024-11-17 02:50:37,009 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1471))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1472 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_7) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 9)))))) (forall ((v_ArrVal_1473 (Array Int Int)) (v_ArrVal_1472 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1471))) (or (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (< 0 (+ (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1473) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 9))))) (or (forall ((v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1472 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem52#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1472))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1474)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_1471 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0))))) is different from false [2024-11-17 02:50:37,031 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 601 treesize of output 559 [2024-11-17 02:50:37,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 383 treesize of output 375 [2024-11-17 02:50:37,049 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 375 treesize of output 367 [2024-11-17 02:50:37,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 363 [2024-11-17 02:50:37,062 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 363 treesize of output 355 [2024-11-17 02:50:37,068 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 355 treesize of output 347 [2024-11-17 02:50:37,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123031476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:37,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:37,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2024-11-17 02:50:37,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364829990] [2024-11-17 02:50:37,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:37,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-17 02:50:37,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:37,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 02:50:37,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=755, Unknown=6, NotChecked=56, Total=930 [2024-11-17 02:50:37,173 INFO L87 Difference]: Start difference. First operand 1660 states and 2111 transitions. Second operand has 25 states, 22 states have (on average 6.909090909090909) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:50:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:40,062 INFO L93 Difference]: Finished difference Result 1662 states and 2119 transitions. [2024-11-17 02:50:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:50:40,063 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.909090909090909) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-17 02:50:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:40,066 INFO L225 Difference]: With dead ends: 1662 [2024-11-17 02:50:40,066 INFO L226 Difference]: Without dead ends: 1662 [2024-11-17 02:50:40,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1075, Unknown=6, NotChecked=68, Total=1332 [2024-11-17 02:50:40,066 INFO L432 NwaCegarLoop]: 751 mSDtfsCounter, 1225 mSDsluCounter, 6784 mSDsCounter, 0 mSdLazyCounter, 6458 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 7535 SdHoareTripleChecker+Invalid, 6479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 6458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:40,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 7535 Invalid, 6479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 6458 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-17 02:50:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-11-17 02:50:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1638. [2024-11-17 02:50:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1258 states have (on average 1.643879173290938) internal successors, (2068), 1626 states have internal predecessors, (2068), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:50:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2086 transitions. [2024-11-17 02:50:40,077 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2086 transitions. Word has length 96 [2024-11-17 02:50:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:40,078 INFO L471 AbstractCegarLoop]: Abstraction has 1638 states and 2086 transitions. [2024-11-17 02:50:40,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.909090909090909) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:50:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2086 transitions. [2024-11-17 02:50:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 02:50:40,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:40,078 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:40,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-17 02:50:40,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:40,281 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:40,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash -931136790, now seen corresponding path program 1 times [2024-11-17 02:50:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502731635] [2024-11-17 02:50:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:40,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:40,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:40,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502731635] [2024-11-17 02:50:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502731635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:40,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:40,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-17 02:50:40,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102328731] [2024-11-17 02:50:40,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:40,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 02:50:40,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:40,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 02:50:40,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-17 02:50:40,742 INFO L87 Difference]: Start difference. First operand 1638 states and 2086 transitions. Second operand has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:43,138 INFO L93 Difference]: Finished difference Result 1669 states and 2127 transitions. [2024-11-17 02:50:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:50:43,138 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-17 02:50:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:43,141 INFO L225 Difference]: With dead ends: 1669 [2024-11-17 02:50:43,141 INFO L226 Difference]: Without dead ends: 1669 [2024-11-17 02:50:43,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-17 02:50:43,142 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 1266 mSDsluCounter, 6520 mSDsCounter, 0 mSdLazyCounter, 5453 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 7264 SdHoareTripleChecker+Invalid, 5474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:43,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 7264 Invalid, 5474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5453 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-17 02:50:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-11-17 02:50:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1665. [2024-11-17 02:50:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1284 states have (on average 1.6331775700934579) internal successors, (2097), 1651 states have internal predecessors, (2097), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-17 02:50:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2117 transitions. [2024-11-17 02:50:43,156 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2117 transitions. Word has length 98 [2024-11-17 02:50:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:43,156 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2117 transitions. [2024-11-17 02:50:43,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2117 transitions. [2024-11-17 02:50:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 02:50:43,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:43,157 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:43,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-17 02:50:43,157 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:43,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:43,159 INFO L85 PathProgramCache]: Analyzing trace with hash -931136789, now seen corresponding path program 1 times [2024-11-17 02:50:43,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:43,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209117602] [2024-11-17 02:50:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:43,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:43,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:43,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:43,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209117602] [2024-11-17 02:50:43,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209117602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:43,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:43,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:50:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870928776] [2024-11-17 02:50:43,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:43,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:50:43,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:43,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:50:43,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:50:43,768 INFO L87 Difference]: Start difference. First operand 1665 states and 2117 transitions. Second operand has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:46,904 INFO L93 Difference]: Finished difference Result 1668 states and 2125 transitions. [2024-11-17 02:50:46,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 02:50:46,904 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-17 02:50:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:46,907 INFO L225 Difference]: With dead ends: 1668 [2024-11-17 02:50:46,907 INFO L226 Difference]: Without dead ends: 1668 [2024-11-17 02:50:46,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-17 02:50:46,908 INFO L432 NwaCegarLoop]: 751 mSDtfsCounter, 1237 mSDsluCounter, 5955 mSDsCounter, 0 mSdLazyCounter, 7174 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 6706 SdHoareTripleChecker+Invalid, 7198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:46,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 6706 Invalid, 7198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7174 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-17 02:50:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2024-11-17 02:50:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1665. [2024-11-17 02:50:46,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1284 states have (on average 1.631619937694704) internal successors, (2095), 1651 states have internal predecessors, (2095), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-17 02:50:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2115 transitions. [2024-11-17 02:50:46,922 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2115 transitions. Word has length 98 [2024-11-17 02:50:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:46,923 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2115 transitions. [2024-11-17 02:50:46,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2115 transitions. [2024-11-17 02:50:46,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 02:50:46,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:46,924 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:46,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 02:50:46,925 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:46,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1603455302, now seen corresponding path program 1 times [2024-11-17 02:50:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:46,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045571674] [2024-11-17 02:50:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:47,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:47,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045571674] [2024-11-17 02:50:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045571674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107104180] [2024-11-17 02:50:47,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:47,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:47,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:47,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:50:47,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 02:50:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:47,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-17 02:50:47,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:47,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:50:47,681 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:50:47,681 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 [2024-11-17 02:50:47,689 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 [2024-11-17 02:50:47,757 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:47,758 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 [2024-11-17 02:50:47,800 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:47,800 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 [2024-11-17 02:50:47,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:47,842 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 [2024-11-17 02:50:47,882 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:47,882 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 [2024-11-17 02:50:47,890 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 [2024-11-17 02:50:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:47,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:47,900 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1782 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1782) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-17 02:50:47,905 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1782 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-17 02:50:47,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1782 (Array Int Int)) (v_ArrVal_1781 (Array Int Int)) (v_ArrVal_1780 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1780))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1781)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1782)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:50:48,057 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-17 02:50:48,057 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 105 treesize of output 104 [2024-11-17 02:50:48,063 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1785 (Array Int Int)) (v_ArrVal_1782 (Array Int Int)) (v_ArrVal_1781 (Array Int Int)) (v_ArrVal_1780 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1785))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1780)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1781)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1782)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-17 02:50:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107104180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:48,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:48,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2024-11-17 02:50:48,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017721322] [2024-11-17 02:50:48,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:48,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 02:50:48,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:48,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 02:50:48,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=488, Unknown=32, NotChecked=196, Total=812 [2024-11-17 02:50:48,067 INFO L87 Difference]: Start difference. First operand 1665 states and 2115 transitions. Second operand has 22 states, 20 states have (on average 7.45) internal successors, (149), 21 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:50:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:51,510 INFO L93 Difference]: Finished difference Result 1667 states and 2123 transitions. [2024-11-17 02:50:51,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 02:50:51,510 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.45) internal successors, (149), 21 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-11-17 02:50:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:51,513 INFO L225 Difference]: With dead ends: 1667 [2024-11-17 02:50:51,513 INFO L226 Difference]: Without dead ends: 1667 [2024-11-17 02:50:51,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=981, Unknown=39, NotChecked=276, Total=1482 [2024-11-17 02:50:51,514 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 1180 mSDsluCounter, 10070 mSDsCounter, 0 mSdLazyCounter, 8151 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 10814 SdHoareTripleChecker+Invalid, 8177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 8151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:51,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 10814 Invalid, 8177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 8151 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-17 02:50:51,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-11-17 02:50:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1664. [2024-11-17 02:50:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1284 states have (on average 1.6300623052959502) internal successors, (2093), 1650 states have internal predecessors, (2093), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-17 02:50:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2113 transitions. [2024-11-17 02:50:51,529 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2113 transitions. Word has length 99 [2024-11-17 02:50:51,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:51,529 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2113 transitions. [2024-11-17 02:50:51,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.45) internal successors, (149), 21 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:50:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2113 transitions. [2024-11-17 02:50:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 02:50:51,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:51,530 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:51,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-17 02:50:51,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:51,731 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:51,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1603455301, now seen corresponding path program 1 times [2024-11-17 02:50:51,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:51,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452514767] [2024-11-17 02:50:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:51,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:52,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:52,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:52,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452514767] [2024-11-17 02:50:52,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452514767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:52,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305792554] [2024-11-17 02:50:52,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:52,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:52,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:52,425 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:50:52,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 02:50:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:52,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-17 02:50:52,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:52,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:50:52,748 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:50:52,748 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 [2024-11-17 02:50:52,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 02:50:52,778 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 [2024-11-17 02:50:52,783 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 [2024-11-17 02:50:52,844 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 22 treesize of output 10 [2024-11-17 02:50:52,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:50:52,933 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:52,933 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 62 treesize of output 57 [2024-11-17 02:50:52,941 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 [2024-11-17 02:50:53,005 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-17 02:50:53,006 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 67 treesize of output 39 [2024-11-17 02:50:53,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:50:53,111 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-17 02:50:53,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 64 [2024-11-17 02:50:53,114 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 [2024-11-17 02:50:53,118 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 [2024-11-17 02:50:53,164 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:53,165 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 62 treesize of output 57 [2024-11-17 02:50:53,169 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 [2024-11-17 02:50:53,183 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 [2024-11-17 02:50:53,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:50:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:53,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:53,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-17 02:50:53,277 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-17 02:50:53,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1955) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1954) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1954))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1955) .cse1 v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-17 02:50:53,305 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1955) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1954) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1954))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1955) .cse2 v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-17 02:50:53,345 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base|))) (and (forall ((v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1952 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| (store .cse3 (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1952) .cse0 v_ArrVal_1955) (select (select (store .cse1 .cse0 v_ArrVal_1954) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1957))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1952 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| (store .cse3 (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1954))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1952) .cse4 v_ArrVal_1955) .cse5 v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-17 02:50:53,538 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1952 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1962))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 (store (select .cse6 .cse0) (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1954))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1963) .cse0 v_ArrVal_1952) .cse1 v_ArrVal_1955) .cse2 v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1952 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1962))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 (store (select .cse10 .cse7) (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1963) .cse7 v_ArrVal_1952) .cse8 v_ArrVal_1955) (select (select (store .cse9 .cse8 v_ArrVal_1954) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1957))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-17 02:50:53,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305792554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:53,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:53,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-11-17 02:50:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033101118] [2024-11-17 02:50:53,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:53,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 02:50:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:53,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 02:50:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=704, Unknown=11, NotChecked=354, Total=1190 [2024-11-17 02:50:53,543 INFO L87 Difference]: Start difference. First operand 1664 states and 2113 transitions. Second operand has 26 states, 23 states have (on average 6.869565217391305) internal successors, (158), 25 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:50:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:58,363 INFO L93 Difference]: Finished difference Result 1666 states and 2121 transitions. [2024-11-17 02:50:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 02:50:58,364 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.869565217391305) internal successors, (158), 25 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-17 02:50:58,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:58,366 INFO L225 Difference]: With dead ends: 1666 [2024-11-17 02:50:58,366 INFO L226 Difference]: Without dead ends: 1666 [2024-11-17 02:50:58,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=1210, Unknown=11, NotChecked=462, Total=1892 [2024-11-17 02:50:58,367 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 1230 mSDsluCounter, 7660 mSDsCounter, 0 mSdLazyCounter, 9335 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 8409 SdHoareTripleChecker+Invalid, 9364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 9335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:58,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 8409 Invalid, 9364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 9335 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-17 02:50:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-17 02:50:58,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1636. [2024-11-17 02:50:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1258 states have (on average 1.6406995230524641) internal successors, (2064), 1624 states have internal predecessors, (2064), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:50:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2082 transitions. [2024-11-17 02:50:58,380 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2082 transitions. Word has length 99 [2024-11-17 02:50:58,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:58,380 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2082 transitions. [2024-11-17 02:50:58,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.869565217391305) internal successors, (158), 25 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:50:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2082 transitions. [2024-11-17 02:50:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 02:50:58,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:58,381 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:58,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-17 02:50:58,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-17 02:50:58,581 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:50:58,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1127220068, now seen corresponding path program 1 times [2024-11-17 02:50:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:58,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350236918] [2024-11-17 02:50:58,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:58,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:59,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:50:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:50:59,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:59,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350236918] [2024-11-17 02:50:59,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350236918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:59,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:59,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-17 02:50:59,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084417682] [2024-11-17 02:50:59,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:59,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 02:50:59,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:59,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 02:50:59,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-17 02:50:59,145 INFO L87 Difference]: Start difference. First operand 1636 states and 2082 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:51:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:51:01,550 INFO L93 Difference]: Finished difference Result 1675 states and 2131 transitions. [2024-11-17 02:51:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:51:01,551 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-17 02:51:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:51:01,553 INFO L225 Difference]: With dead ends: 1675 [2024-11-17 02:51:01,553 INFO L226 Difference]: Without dead ends: 1675 [2024-11-17 02:51:01,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-17 02:51:01,554 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 1261 mSDsluCounter, 6507 mSDsCounter, 0 mSdLazyCounter, 5449 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 7256 SdHoareTripleChecker+Invalid, 5470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:51:01,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 7256 Invalid, 5470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5449 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-17 02:51:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2024-11-17 02:51:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1671. [2024-11-17 02:51:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1292 states have (on average 1.6261609907120742) internal successors, (2101), 1657 states have internal predecessors, (2101), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-17 02:51:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2121 transitions. [2024-11-17 02:51:01,566 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2121 transitions. Word has length 102 [2024-11-17 02:51:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:51:01,567 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2121 transitions. [2024-11-17 02:51:01,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:51:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2121 transitions. [2024-11-17 02:51:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 02:51:01,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:51:01,568 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:51:01,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-17 02:51:01,568 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr515REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:51:01,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:51:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1127220069, now seen corresponding path program 1 times [2024-11-17 02:51:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:51:01,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328734953] [2024-11-17 02:51:01,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:51:01,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:51:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:51:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:51:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:51:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:51:02,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:51:02,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328734953] [2024-11-17 02:51:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328734953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:51:02,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:51:02,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-17 02:51:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097007217] [2024-11-17 02:51:02,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:51:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 02:51:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:51:02,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 02:51:02,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-17 02:51:02,456 INFO L87 Difference]: Start difference. First operand 1671 states and 2121 transitions. Second operand has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:51:06,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:51:06,162 INFO L93 Difference]: Finished difference Result 1674 states and 2129 transitions. [2024-11-17 02:51:06,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 02:51:06,162 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-17 02:51:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:51:06,164 INFO L225 Difference]: With dead ends: 1674 [2024-11-17 02:51:06,164 INFO L226 Difference]: Without dead ends: 1674 [2024-11-17 02:51:06,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-17 02:51:06,164 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 1239 mSDsluCounter, 6655 mSDsCounter, 0 mSdLazyCounter, 7762 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 7399 SdHoareTripleChecker+Invalid, 7786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:51:06,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 7399 Invalid, 7786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7762 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-17 02:51:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2024-11-17 02:51:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1671. [2024-11-17 02:51:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1292 states have (on average 1.6246130030959753) internal successors, (2099), 1657 states have internal predecessors, (2099), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-17 02:51:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2119 transitions. [2024-11-17 02:51:06,177 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2119 transitions. Word has length 102 [2024-11-17 02:51:06,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:51:06,177 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2119 transitions. [2024-11-17 02:51:06,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:51:06,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2119 transitions. [2024-11-17 02:51:06,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-17 02:51:06,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:51:06,178 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:51:06,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-17 02:51:06,178 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-17 02:51:06,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:51:06,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1485121740, now seen corresponding path program 1 times [2024-11-17 02:51:06,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:51:06,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566932183] [2024-11-17 02:51:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:51:06,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:51:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:51:06,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-17 02:51:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:51:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:51:06,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:51:06,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566932183] [2024-11-17 02:51:06,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566932183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:51:06,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710706176] [2024-11-17 02:51:06,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:51:06,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:51:06,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:51:06,788 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:51:06,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 02:51:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:51:07,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 02:51:07,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:51:07,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:51:07,077 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:51:07,077 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 [2024-11-17 02:51:07,081 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 [2024-11-17 02:51:07,136 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:51:07,136 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 [2024-11-17 02:51:07,154 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:51:07,154 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 [2024-11-17 02:51:07,192 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:51:07,192 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 [2024-11-17 02:51:07,227 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:51:07,228 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 [2024-11-17 02:51:07,265 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:51:07,265 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 [2024-11-17 02:51:07,273 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 [2024-11-17 02:51:07,287 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 02:51:07,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-17 02:51:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:51:07,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:51:07,884 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-17 02:51:07,884 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 597 treesize of output 794 [2024-11-17 02:51:07,901 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2305))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2298)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2299)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-17 02:51:07,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710706176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:51:07,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:51:07,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 21 [2024-11-17 02:51:07,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858423182] [2024-11-17 02:51:07,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:51:07,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 02:51:07,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:51:07,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 02:51:07,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=811, Unknown=47, NotChecked=60, Total=1056 [2024-11-17 02:51:07,904 INFO L87 Difference]: Start difference. First operand 1671 states and 2119 transitions. Second operand has 22 states, 20 states have (on average 7.4) internal successors, (148), 20 states have internal predecessors, (148), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)