./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.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 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:13:20,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:13:20,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 18:13:20,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:13:20,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:13:20,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:13:20,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:13:20,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:13:20,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:13:20,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:13:20,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:13:20,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:13:20,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:13:20,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:13:20,758 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:13:20,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:13:20,759 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:13:20,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:13:20,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:13:20,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:13:20,759 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:13:20,765 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:13:20,765 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:13:20,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:13:20,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:13:20,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:13:20,765 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:13:20,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:13:20,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:13:20,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:13:20,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:13:20,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:13:20,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:13:20,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:13:20,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:13:20,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:13:20,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:13:20,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:13:20,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:13:20,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:13:20,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:13:20,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:13:20,769 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 -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2024-10-14 18:13:20,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:13:20,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:13:20,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:13:20,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:13:20,989 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:13:20,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2024-10-14 18:13:22,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:13:22,553 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:13:22,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2024-10-14 18:13:22,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/622b27d1f/fc86a39a5d4942e0b20621cff75c3de3/FLAG5e70b3b20 [2024-10-14 18:13:22,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/622b27d1f/fc86a39a5d4942e0b20621cff75c3de3 [2024-10-14 18:13:22,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:13:22,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:13:22,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:13:22,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:13:22,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:13:22,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:22,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@787bc71c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22, skipping insertion in model container [2024-10-14 18:13:22,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:22,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:13:22,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:13:22,902 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:13:22,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:13:22,976 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:13:22,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22 WrapperNode [2024-10-14 18:13:22,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:13:22,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:13:22,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:13:22,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:13:22,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:23,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:23,029 INFO L138 Inliner]: procedures = 127, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 154 [2024-10-14 18:13:23,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:13:23,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:13:23,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:13:23,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:13:23,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:23,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:23,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:23,079 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 15 writes are split as follows [0, 13, 2]. [2024-10-14 18:13:23,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:23,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:23,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:23,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:23,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:23,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:23,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:13:23,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:13:23,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:13:23,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:13:23,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (1/1) ... [2024-10-14 18:13:23,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:13:23,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:23,170 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-10-14 18:13:23,172 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-10-14 18:13:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 18:13:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 18:13:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 18:13:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 18:13:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 18:13:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 18:13:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-14 18:13:23,227 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-14 18:13:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:13:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:13:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 18:13:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:13:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:13:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 18:13:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:13:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:13:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 18:13:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:13:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 18:13:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 18:13:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 18:13:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 18:13:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 18:13:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 18:13:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:13:23,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:13:23,355 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:13:23,357 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:13:23,698 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2024-10-14 18:13:23,699 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:13:23,734 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:13:23,735 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 18:13:23,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:13:23 BoogieIcfgContainer [2024-10-14 18:13:23,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:13:23,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:13:23,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:13:23,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:13:23,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:13:22" (1/3) ... [2024-10-14 18:13:23,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cc665e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:13:23, skipping insertion in model container [2024-10-14 18:13:23,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:22" (2/3) ... [2024-10-14 18:13:23,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cc665e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:13:23, skipping insertion in model container [2024-10-14 18:13:23,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:13:23" (3/3) ... [2024-10-14 18:13:23,745 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2024-10-14 18:13:23,768 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:13:23,768 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2024-10-14 18:13:23,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:13:23,819 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;@66c316b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:13:23,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2024-10-14 18:13:23,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 58 states have (on average 2.3448275862068964) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 18:13:23,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:23,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 18:13:23,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:23,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:23,835 INFO L85 PathProgramCache]: Analyzing trace with hash 246714355, now seen corresponding path program 1 times [2024-10-14 18:13:23,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:23,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959295070] [2024-10-14 18:13:23,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:23,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:13:24,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:24,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959295070] [2024-10-14 18:13:24,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959295070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:24,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:24,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:13:24,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464834864] [2024-10-14 18:13:24,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:24,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:13:24,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:24,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:13:24,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:13:24,064 INFO L87 Difference]: Start difference. First operand has 127 states, 58 states have (on average 2.3448275862068964) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:13:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:24,168 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2024-10-14 18:13:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:13:24,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 18:13:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:24,175 INFO L225 Difference]: With dead ends: 123 [2024-10-14 18:13:24,175 INFO L226 Difference]: Without dead ends: 121 [2024-10-14 18:13:24,176 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-10-14 18:13:24,180 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:24,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-14 18:13:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-14 18:13:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 56 states have (on average 2.2142857142857144) internal successors, (124), 116 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2024-10-14 18:13:24,242 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 5 [2024-10-14 18:13:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:24,246 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2024-10-14 18:13:24,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:13:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2024-10-14 18:13:24,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 18:13:24,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:24,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 18:13:24,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 18:13:24,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:24,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:24,248 INFO L85 PathProgramCache]: Analyzing trace with hash 246714356, now seen corresponding path program 1 times [2024-10-14 18:13:24,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:24,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244784682] [2024-10-14 18:13:24,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:24,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:13:24,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:24,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244784682] [2024-10-14 18:13:24,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244784682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:24,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:24,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:13:24,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207195840] [2024-10-14 18:13:24,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:24,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:13:24,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:24,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:13:24,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:13:24,405 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:13:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:24,485 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2024-10-14 18:13:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:13:24,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 18:13:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:24,486 INFO L225 Difference]: With dead ends: 118 [2024-10-14 18:13:24,486 INFO L226 Difference]: Without dead ends: 118 [2024-10-14 18:13:24,487 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-10-14 18:13:24,488 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:24,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 183 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-14 18:13:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-14 18:13:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2024-10-14 18:13:24,494 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 5 [2024-10-14 18:13:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:24,494 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2024-10-14 18:13:24,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:13:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2024-10-14 18:13:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:13:24,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:24,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:24,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 18:13:24,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:24,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:24,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1095333489, now seen corresponding path program 1 times [2024-10-14 18:13:24,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:24,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27507335] [2024-10-14 18:13:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:24,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:13:24,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:24,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27507335] [2024-10-14 18:13:24,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27507335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:24,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:24,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:13:24,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309456959] [2024-10-14 18:13:24,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:24,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:13:24,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:24,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:13:24,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:13:24,645 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:13:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:24,784 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2024-10-14 18:13:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:13:24,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:13:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:24,786 INFO L225 Difference]: With dead ends: 129 [2024-10-14 18:13:24,786 INFO L226 Difference]: Without dead ends: 129 [2024-10-14 18:13:24,786 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-10-14 18:13:24,787 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 10 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:24,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 257 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:24,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-14 18:13:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2024-10-14 18:13:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 57 states have (on average 2.1403508771929824) internal successors, (122), 114 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2024-10-14 18:13:24,797 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 11 [2024-10-14 18:13:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:24,798 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2024-10-14 18:13:24,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:13:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2024-10-14 18:13:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 18:13:24,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:24,800 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:24,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 18:13:24,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:24,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:24,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1860275105, now seen corresponding path program 1 times [2024-10-14 18:13:24,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:24,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804500305] [2024-10-14 18:13:24,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:24,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:24,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:13:25,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:25,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804500305] [2024-10-14 18:13:25,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804500305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:25,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:25,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:13:25,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062222088] [2024-10-14 18:13:25,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:25,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:13:25,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:25,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:13:25,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:13:25,009 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:13:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:25,237 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2024-10-14 18:13:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:13:25,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-14 18:13:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:25,239 INFO L225 Difference]: With dead ends: 118 [2024-10-14 18:13:25,239 INFO L226 Difference]: Without dead ends: 118 [2024-10-14 18:13:25,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:13:25,242 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:25,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 369 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:13:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-14 18:13:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-14 18:13:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2024-10-14 18:13:25,253 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 19 [2024-10-14 18:13:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:25,253 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2024-10-14 18:13:25,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:13:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2024-10-14 18:13:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 18:13:25,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:25,254 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:25,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 18:13:25,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:25,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:25,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1860275106, now seen corresponding path program 1 times [2024-10-14 18:13:25,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:25,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249790286] [2024-10-14 18:13:25,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:25,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:25,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:25,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:25,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249790286] [2024-10-14 18:13:25,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249790286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:25,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:25,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:13:25,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519295786] [2024-10-14 18:13:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:25,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:13:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:13:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:13:25,484 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:13:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:25,694 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2024-10-14 18:13:25,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:13:25,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-14 18:13:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:25,696 INFO L225 Difference]: With dead ends: 117 [2024-10-14 18:13:25,696 INFO L226 Difference]: Without dead ends: 117 [2024-10-14 18:13:25,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:13:25,697 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:25,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 393 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:13:25,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-14 18:13:25,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-14 18:13:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 112 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2024-10-14 18:13:25,705 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 19 [2024-10-14 18:13:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:25,705 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2024-10-14 18:13:25,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:13:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2024-10-14 18:13:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:13:25,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:25,706 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:25,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 18:13:25,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:25,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:25,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1017980482, now seen corresponding path program 1 times [2024-10-14 18:13:25,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:25,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574385559] [2024-10-14 18:13:25,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:25,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:25,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:25,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:25,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574385559] [2024-10-14 18:13:25,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574385559] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:25,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355800048] [2024-10-14 18:13:25,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:25,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:25,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:25,947 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-10-14 18:13:25,949 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-10-14 18:13:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:26,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 18:13:26,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:26,102 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-10-14 18:13:26,136 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-14 18:13:26,173 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 18:13:26,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 18:13:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-14 18:13:26,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355800048] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:26,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:13:26,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-10-14 18:13:26,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89096027] [2024-10-14 18:13:26,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:26,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 18:13:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:26,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 18:13:26,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-10-14 18:13:26,228 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:26,518 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2024-10-14 18:13:26,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:13:26,518 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-10-14 18:13:26,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:26,519 INFO L225 Difference]: With dead ends: 122 [2024-10-14 18:13:26,519 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 18:13:26,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-10-14 18:13:26,520 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:26,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 432 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 429 Invalid, 0 Unknown, 129 Unchecked, 0.2s Time] [2024-10-14 18:13:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 18:13:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-14 18:13:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 116 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:13:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2024-10-14 18:13:26,524 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 21 [2024-10-14 18:13:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:26,525 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2024-10-14 18:13:26,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2024-10-14 18:13:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:13:26,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:26,532 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:26,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 18:13:26,733 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,SelfDestructingSolverStorable5 [2024-10-14 18:13:26,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:26,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:26,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1017980483, now seen corresponding path program 1 times [2024-10-14 18:13:26,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:26,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402109261] [2024-10-14 18:13:26,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:26,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:27,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402109261] [2024-10-14 18:13:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402109261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:27,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059563385] [2024-10-14 18:13:27,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:27,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:27,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:27,098 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-10-14 18:13:27,099 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-10-14 18:13:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:27,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 18:13:27,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:27,208 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-10-14 18:13:27,217 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-10-14 18:13:27,365 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-14 18:13:27,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:27,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:13:27,431 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:13:27,431 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-10-14 18:13:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-14 18:13:27,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:27,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059563385] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:27,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:13:27,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-14 18:13:27,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699498906] [2024-10-14 18:13:27,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:27,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 18:13:27,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 18:13:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2024-10-14 18:13:27,649 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 16 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:13:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:28,018 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2024-10-14 18:13:28,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:13:28,019 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2024-10-14 18:13:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:28,019 INFO L225 Difference]: With dead ends: 122 [2024-10-14 18:13:28,019 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 18:13:28,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2024-10-14 18:13:28,020 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:28,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 609 Invalid, 0 Unknown, 128 Unchecked, 0.3s Time] [2024-10-14 18:13:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 18:13:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-14 18:13:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 116 states have internal predecessors, (125), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:13:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2024-10-14 18:13:28,024 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 21 [2024-10-14 18:13:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:28,024 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2024-10-14 18:13:28,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:13:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2024-10-14 18:13:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:13:28,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:28,025 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:28,038 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-10-14 18:13:28,229 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,SelfDestructingSolverStorable6 [2024-10-14 18:13:28,230 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:28,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:28,230 INFO L85 PathProgramCache]: Analyzing trace with hash -973146152, now seen corresponding path program 1 times [2024-10-14 18:13:28,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:28,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022285289] [2024-10-14 18:13:28,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:28,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:28,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:28,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:28,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:28,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022285289] [2024-10-14 18:13:28,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022285289] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:28,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325366630] [2024-10-14 18:13:28,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:28,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:28,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:28,369 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-10-14 18:13:28,374 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-10-14 18:13:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:28,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 18:13:28,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:28,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:28,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325366630] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:13:28,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:13:28,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-10-14 18:13:28,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492411149] [2024-10-14 18:13:28,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:28,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:13:28,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:28,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:13:28,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:13:28,524 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:13:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:28,651 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2024-10-14 18:13:28,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:13:28,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-14 18:13:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:28,652 INFO L225 Difference]: With dead ends: 122 [2024-10-14 18:13:28,652 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 18:13:28,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:13:28,653 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:28,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 552 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 18:13:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-14 18:13:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 116 states have internal predecessors, (124), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:13:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2024-10-14 18:13:28,656 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 23 [2024-10-14 18:13:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:28,656 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2024-10-14 18:13:28,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:13:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2024-10-14 18:13:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 18:13:28,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:28,657 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:28,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 18:13:28,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:28,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:28,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash -107540303, now seen corresponding path program 1 times [2024-10-14 18:13:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78938668] [2024-10-14 18:13:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:28,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 18:13:28,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:28,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78938668] [2024-10-14 18:13:28,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78938668] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:28,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638654009] [2024-10-14 18:13:28,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:28,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:28,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:28,980 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-10-14 18:13:28,987 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-10-14 18:13:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:29,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 18:13:29,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:29,121 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-10-14 18:13:29,189 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-14 18:13:29,230 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 18:13:29,231 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-10-14 18:13:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-10-14 18:13:29,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:29,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638654009] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:29,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:13:29,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2024-10-14 18:13:29,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906725662] [2024-10-14 18:13:29,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:29,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 18:13:29,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:29,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 18:13:29,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2024-10-14 18:13:29,319 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:13:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:29,671 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2024-10-14 18:13:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:13:29,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-14 18:13:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:29,675 INFO L225 Difference]: With dead ends: 121 [2024-10-14 18:13:29,675 INFO L226 Difference]: Without dead ends: 121 [2024-10-14 18:13:29,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2024-10-14 18:13:29,675 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 9 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:29,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 428 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 415 Invalid, 0 Unknown, 126 Unchecked, 0.3s Time] [2024-10-14 18:13:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-14 18:13:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-14 18:13:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 115 states have internal predecessors, (123), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:13:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2024-10-14 18:13:29,686 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 24 [2024-10-14 18:13:29,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:29,686 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2024-10-14 18:13:29,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:13:29,687 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2024-10-14 18:13:29,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 18:13:29,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:29,691 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:29,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 18:13:29,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:29,891 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:29,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:29,892 INFO L85 PathProgramCache]: Analyzing trace with hash -107540302, now seen corresponding path program 1 times [2024-10-14 18:13:29,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:29,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560263971] [2024-10-14 18:13:29,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:29,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:30,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:30,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:30,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:30,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560263971] [2024-10-14 18:13:30,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560263971] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:30,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697041798] [2024-10-14 18:13:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:30,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:30,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:30,057 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-10-14 18:13:30,058 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-10-14 18:13:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:30,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 18:13:30,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:30,192 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-10-14 18:13:30,196 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-10-14 18:13:30,333 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-14 18:13:30,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:30,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:13:30,370 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:13:30,371 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-10-14 18:13:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-14 18:13:30,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:30,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697041798] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:30,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:13:30,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-14 18:13:30,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389856876] [2024-10-14 18:13:30,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:30,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 18:13:30,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:30,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 18:13:30,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-10-14 18:13:30,546 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:13:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:31,045 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2024-10-14 18:13:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:13:31,045 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-14 18:13:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:31,048 INFO L225 Difference]: With dead ends: 138 [2024-10-14 18:13:31,048 INFO L226 Difference]: Without dead ends: 138 [2024-10-14 18:13:31,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-10-14 18:13:31,049 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 20 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:31,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 689 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 666 Invalid, 0 Unknown, 148 Unchecked, 0.4s Time] [2024-10-14 18:13:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-14 18:13:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2024-10-14 18:13:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.957142857142857) internal successors, (137), 124 states have internal predecessors, (137), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:13:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2024-10-14 18:13:31,054 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 24 [2024-10-14 18:13:31,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:31,054 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2024-10-14 18:13:31,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:13:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2024-10-14 18:13:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 18:13:31,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:31,055 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:31,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 18:13:31,259 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,SelfDestructingSolverStorable9 [2024-10-14 18:13:31,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:31,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:31,261 INFO L85 PathProgramCache]: Analyzing trace with hash 961217908, now seen corresponding path program 1 times [2024-10-14 18:13:31,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:31,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634503016] [2024-10-14 18:13:31,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:31,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:31,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:13:31,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:31,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634503016] [2024-10-14 18:13:31,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634503016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:31,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:31,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:13:31,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781422395] [2024-10-14 18:13:31,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:31,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:13:31,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:31,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:13:31,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:13:31,405 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:13:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:31,661 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2024-10-14 18:13:31,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:13:31,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-14 18:13:31,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:31,662 INFO L225 Difference]: With dead ends: 130 [2024-10-14 18:13:31,662 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 18:13:31,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:13:31,663 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 6 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:31,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 421 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:13:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 18:13:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-14 18:13:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 70 states have (on average 1.9428571428571428) internal successors, (136), 123 states have internal predecessors, (136), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:13:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2024-10-14 18:13:31,667 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 25 [2024-10-14 18:13:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:31,668 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2024-10-14 18:13:31,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:13:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2024-10-14 18:13:31,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 18:13:31,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:31,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:31,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 18:13:31,670 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:31,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:31,671 INFO L85 PathProgramCache]: Analyzing trace with hash 961217909, now seen corresponding path program 1 times [2024-10-14 18:13:31,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:31,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352551332] [2024-10-14 18:13:31,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:31,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:31,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:31,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:31,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352551332] [2024-10-14 18:13:31,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352551332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:31,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:31,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:13:31,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324720422] [2024-10-14 18:13:31,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:31,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:13:31,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:31,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:13:31,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:13:31,946 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:13:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:32,192 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2024-10-14 18:13:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:13:32,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-14 18:13:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:32,194 INFO L225 Difference]: With dead ends: 129 [2024-10-14 18:13:32,194 INFO L226 Difference]: Without dead ends: 129 [2024-10-14 18:13:32,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:13:32,194 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 5 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:32,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 484 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:13:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-14 18:13:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-14 18:13:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 70 states have (on average 1.9285714285714286) internal successors, (135), 122 states have internal predecessors, (135), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:13:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2024-10-14 18:13:32,198 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 25 [2024-10-14 18:13:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:32,198 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2024-10-14 18:13:32,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:13:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2024-10-14 18:13:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:13:32,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:32,199 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:32,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 18:13:32,200 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:32,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1218977859, now seen corresponding path program 1 times [2024-10-14 18:13:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:32,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47939696] [2024-10-14 18:13:32,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:32,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:32,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:32,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:13:32,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:32,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47939696] [2024-10-14 18:13:32,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47939696] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:32,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616609612] [2024-10-14 18:13:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:32,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:32,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:32,595 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-10-14 18:13:32,595 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-10-14 18:13:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:32,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 18:13:32,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:32,754 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-10-14 18:13:32,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:13:32,802 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:13:32,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-14 18:13:32,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-14 18:13:32,862 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-10-14 18:13:32,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:32,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:13:32,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:13:32,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:32,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:13:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2024-10-14 18:13:32,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:33,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616609612] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:33,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:13:33,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-10-14 18:13:33,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029849897] [2024-10-14 18:13:33,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:33,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 18:13:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:33,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 18:13:33,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-10-14 18:13:33,017 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand has 17 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:13:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:33,319 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2024-10-14 18:13:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:13:33,319 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-10-14 18:13:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:33,320 INFO L225 Difference]: With dead ends: 138 [2024-10-14 18:13:33,320 INFO L226 Difference]: Without dead ends: 138 [2024-10-14 18:13:33,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=308, Unknown=1, NotChecked=36, Total=420 [2024-10-14 18:13:33,321 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 287 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:33,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 294 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 451 Invalid, 0 Unknown, 127 Unchecked, 0.2s Time] [2024-10-14 18:13:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-14 18:13:33,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2024-10-14 18:13:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 70 states have (on average 1.8142857142857143) internal successors, (127), 114 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:13:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2024-10-14 18:13:33,324 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 34 [2024-10-14 18:13:33,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:33,324 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2024-10-14 18:13:33,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:13:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2024-10-14 18:13:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:13:33,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:33,325 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:33,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 18:13:33,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:33,530 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:33,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1218977860, now seen corresponding path program 1 times [2024-10-14 18:13:33,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:33,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589653796] [2024-10-14 18:13:33,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:33,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:33,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:33,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:13:33,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:33,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589653796] [2024-10-14 18:13:33,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589653796] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:33,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528488665] [2024-10-14 18:13:33,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:33,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:33,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:33,986 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-10-14 18:13:33,989 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-10-14 18:13:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:34,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 18:13:34,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:34,204 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-10-14 18:13:34,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:13:34,224 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-10-14 18:13:34,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:34,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:13:34,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:13:34,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:34,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:13:34,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:13:34,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:34,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:13:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 18:13:34,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:13:34,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528488665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:34,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:13:34,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-14 18:13:34,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353312672] [2024-10-14 18:13:34,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:34,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:13:34,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:34,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:13:34,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=123, Unknown=1, NotChecked=22, Total=182 [2024-10-14 18:13:34,520 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:34,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:34,653 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2024-10-14 18:13:34,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:13:34,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-10-14 18:13:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:34,655 INFO L225 Difference]: With dead ends: 116 [2024-10-14 18:13:34,655 INFO L226 Difference]: Without dead ends: 116 [2024-10-14 18:13:34,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2024-10-14 18:13:34,656 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 13 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:34,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 229 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 135 Unchecked, 0.1s Time] [2024-10-14 18:13:34,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-14 18:13:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-14 18:13:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 70 states have (on average 1.7428571428571429) internal successors, (122), 109 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:13:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2024-10-14 18:13:34,659 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 34 [2024-10-14 18:13:34,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:34,659 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2024-10-14 18:13:34,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2024-10-14 18:13:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:13:34,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:34,660 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:34,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 18:13:34,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:34,861 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:34,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:34,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2056327038, now seen corresponding path program 1 times [2024-10-14 18:13:34,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:34,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444351175] [2024-10-14 18:13:34,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:34,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:34,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:35,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:35,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 18:13:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 18:13:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444351175] [2024-10-14 18:13:35,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444351175] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:35,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033204063] [2024-10-14 18:13:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:35,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:35,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:35,036 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-10-14 18:13:35,043 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-10-14 18:13:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:35,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:13:35,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 18:13:35,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:13:35,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033204063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:35,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:13:35,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-14 18:13:35,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606532623] [2024-10-14 18:13:35,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:35,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:13:35,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:35,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:13:35,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:13:35,270 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:35,302 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2024-10-14 18:13:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:13:35,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-10-14 18:13:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:35,302 INFO L225 Difference]: With dead ends: 98 [2024-10-14 18:13:35,303 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 18:13:35,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-10-14 18:13:35,304 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:35,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:13:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 18:13:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-14 18:13:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.736842105263158) internal successors, (99), 93 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-10-14 18:13:35,307 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 34 [2024-10-14 18:13:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:35,307 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-10-14 18:13:35,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:35,308 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-10-14 18:13:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 18:13:35,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:35,308 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:35,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 18:13:35,509 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,SelfDestructingSolverStorable14 [2024-10-14 18:13:35,509 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:35,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:35,509 INFO L85 PathProgramCache]: Analyzing trace with hash 620927698, now seen corresponding path program 1 times [2024-10-14 18:13:35,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:35,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286930246] [2024-10-14 18:13:35,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:35,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:35,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:35,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:35,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-14 18:13:35,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:35,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286930246] [2024-10-14 18:13:35,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286930246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:35,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:35,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:13:35,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757144026] [2024-10-14 18:13:35,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:35,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:13:35,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:35,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:13:35,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:13:35,693 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:13:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:35,859 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2024-10-14 18:13:35,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:13:35,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-10-14 18:13:35,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:35,860 INFO L225 Difference]: With dead ends: 94 [2024-10-14 18:13:35,860 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 18:13:35,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:13:35,861 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 16 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:35,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 281 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:13:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 18:13:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 18:13:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 89 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2024-10-14 18:13:35,863 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 37 [2024-10-14 18:13:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:35,863 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2024-10-14 18:13:35,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:13:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-10-14 18:13:35,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 18:13:35,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:35,864 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:35,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 18:13:35,864 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:35,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:35,865 INFO L85 PathProgramCache]: Analyzing trace with hash 620927699, now seen corresponding path program 1 times [2024-10-14 18:13:35,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:35,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49403586] [2024-10-14 18:13:35,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:35,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:35,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:35,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:36,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:13:36,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:36,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49403586] [2024-10-14 18:13:36,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49403586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:36,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533168973] [2024-10-14 18:13:36,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:36,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:36,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:36,016 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-10-14 18:13:36,017 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-10-14 18:13:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:36,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 18:13:36,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:36,250 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-10-14 18:13:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:13:36,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:13:36,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533168973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:36,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:13:36,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-14 18:13:36,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200524003] [2024-10-14 18:13:36,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:36,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:13:36,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:36,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:13:36,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-14 18:13:36,318 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:13:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:36,425 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-10-14 18:13:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:13:36,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-10-14 18:13:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:36,426 INFO L225 Difference]: With dead ends: 90 [2024-10-14 18:13:36,426 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 18:13:36,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-14 18:13:36,426 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 15 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:36,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 262 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:36,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 18:13:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 18:13:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 85 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2024-10-14 18:13:36,429 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 37 [2024-10-14 18:13:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:36,429 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2024-10-14 18:13:36,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:13:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2024-10-14 18:13:36,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 18:13:36,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:36,429 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:36,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 18:13:36,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 18:13:36,634 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:36,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:36,634 INFO L85 PathProgramCache]: Analyzing trace with hash 620938621, now seen corresponding path program 1 times [2024-10-14 18:13:36,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:36,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352577681] [2024-10-14 18:13:36,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:36,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:36,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:36,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:36,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:13:36,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:36,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352577681] [2024-10-14 18:13:36,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352577681] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:36,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255325111] [2024-10-14 18:13:36,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:36,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:36,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:36,902 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:13:36,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 18:13:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:37,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-14 18:13:37,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:37,268 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-10-14 18:13:37,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:13:37,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:13:37,425 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-14 18:13:37,467 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-14 18:13:37,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-10-14 18:13:37,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 18:13:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-10-14 18:13:37,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:37,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255325111] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:37,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:13:37,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-14 18:13:37,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834976054] [2024-10-14 18:13:37,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:37,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 18:13:37,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:37,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 18:13:37,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=367, Unknown=1, NotChecked=38, Total=462 [2024-10-14 18:13:37,522 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 21 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:13:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:37,861 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2024-10-14 18:13:37,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:13:37,862 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2024-10-14 18:13:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:37,862 INFO L225 Difference]: With dead ends: 89 [2024-10-14 18:13:37,862 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 18:13:37,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=522, Unknown=1, NotChecked=46, Total=650 [2024-10-14 18:13:37,863 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 57 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:37,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 550 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 657 Invalid, 0 Unknown, 91 Unchecked, 0.3s Time] [2024-10-14 18:13:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 18:13:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-14 18:13:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 84 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2024-10-14 18:13:37,865 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 37 [2024-10-14 18:13:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:37,865 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2024-10-14 18:13:37,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:13:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-10-14 18:13:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 18:13:37,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:37,866 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:37,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 18:13:38,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 18:13:38,071 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:38,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash 620938622, now seen corresponding path program 1 times [2024-10-14 18:13:38,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:38,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897125779] [2024-10-14 18:13:38,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:38,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:38,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:38,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:13:38,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897125779] [2024-10-14 18:13:38,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897125779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490556186] [2024-10-14 18:13:38,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:38,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:38,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:38,521 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:13:38,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 18:13:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:38,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-14 18:13:38,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:38,841 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-10-14 18:13:39,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:13:39,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:13:39,075 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-10-14 18:13:39,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:39,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:13:39,154 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:13:39,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:13:39,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 18:13:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-10-14 18:13:39,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:39,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490556186] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:39,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:13:39,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2024-10-14 18:13:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123126337] [2024-10-14 18:13:39,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:39,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 18:13:39,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:39,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 18:13:39,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=538, Unknown=1, NotChecked=46, Total=650 [2024-10-14 18:13:39,475 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:13:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:40,210 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2024-10-14 18:13:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 18:13:40,210 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2024-10-14 18:13:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:40,211 INFO L225 Difference]: With dead ends: 94 [2024-10-14 18:13:40,211 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 18:13:40,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=1129, Unknown=1, NotChecked=68, Total=1332 [2024-10-14 18:13:40,212 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 54 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:40,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 741 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 838 Invalid, 0 Unknown, 95 Unchecked, 0.5s Time] [2024-10-14 18:13:40,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 18:13:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 18:13:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2024-10-14 18:13:40,214 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 37 [2024-10-14 18:13:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:40,214 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2024-10-14 18:13:40,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:13:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2024-10-14 18:13:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 18:13:40,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:40,219 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:40,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-14 18:13:40,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:40,420 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:40,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash -367066871, now seen corresponding path program 1 times [2024-10-14 18:13:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:40,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936208869] [2024-10-14 18:13:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:40,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:40,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:40,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:13:40,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:40,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936208869] [2024-10-14 18:13:40,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936208869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:40,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273234528] [2024-10-14 18:13:40,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:40,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:40,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:40,756 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:13:40,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 18:13:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:41,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 18:13:41,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:41,042 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-10-14 18:13:41,050 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-10-14 18:13:41,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:13:41,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:13:41,101 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-14 18:13:41,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:41,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:13:41,132 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:13:41,132 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-10-14 18:13:41,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:13:41,187 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-10-14 18:13:41,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:41,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:13:41,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:13:41,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:41,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:13:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 10 not checked. [2024-10-14 18:13:41,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:41,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273234528] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:41,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:13:41,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 17 [2024-10-14 18:13:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346431152] [2024-10-14 18:13:41,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:41,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 18:13:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:41,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 18:13:41,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=231, Unknown=2, NotChecked=62, Total=342 [2024-10-14 18:13:41,448 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:13:41,464 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|)))) is different from true [2024-10-14 18:13:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:41,791 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-10-14 18:13:41,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 18:13:41,792 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2024-10-14 18:13:41,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:41,793 INFO L225 Difference]: With dead ends: 88 [2024-10-14 18:13:41,793 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 18:13:41,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=425, Unknown=4, NotChecked=132, Total=650 [2024-10-14 18:13:41,793 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 70 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:41,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 449 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 454 Invalid, 0 Unknown, 218 Unchecked, 0.2s Time] [2024-10-14 18:13:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 18:13:41,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 18:13:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 82 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-10-14 18:13:41,796 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 40 [2024-10-14 18:13:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:41,796 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-10-14 18:13:41,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:13:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-10-14 18:13:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 18:13:41,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:41,797 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:41,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-14 18:13:42,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:42,002 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:42,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1131939099, now seen corresponding path program 1 times [2024-10-14 18:13:42,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:42,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611389453] [2024-10-14 18:13:42,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:42,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:42,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:42,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:42,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 18:13:42,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:42,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611389453] [2024-10-14 18:13:42,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611389453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:42,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:42,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:13:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094669295] [2024-10-14 18:13:42,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:42,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:13:42,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:42,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:13:42,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:13:42,107 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:13:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:42,222 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-10-14 18:13:42,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:13:42,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-10-14 18:13:42,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:42,223 INFO L225 Difference]: With dead ends: 87 [2024-10-14 18:13:42,223 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 18:13:42,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:13:42,223 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:42,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 257 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 18:13:42,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-14 18:13:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-10-14 18:13:42,231 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 41 [2024-10-14 18:13:42,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:42,231 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-10-14 18:13:42,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:13:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-10-14 18:13:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 18:13:42,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:42,232 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:42,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 18:13:42,232 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:42,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:42,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1131939098, now seen corresponding path program 1 times [2024-10-14 18:13:42,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:42,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720197456] [2024-10-14 18:13:42,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:42,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:42,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:42,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:13:42,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720197456] [2024-10-14 18:13:42,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720197456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773196325] [2024-10-14 18:13:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:42,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:42,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:42,860 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:13:42,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 18:13:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:43,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 18:13:43,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:43,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-10-14 18:13:43,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-10-14 18:13:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 18:13:43,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:13:43,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773196325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:43,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:13:43,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2024-10-14 18:13:43,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965706756] [2024-10-14 18:13:43,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:43,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:13:43,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:43,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:13:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-14 18:13:43,193 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:13:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:43,287 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-10-14 18:13:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:13:43,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-10-14 18:13:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:43,288 INFO L225 Difference]: With dead ends: 86 [2024-10-14 18:13:43,288 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 18:13:43,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-10-14 18:13:43,289 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:43,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 235 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 18:13:43,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-14 18:13:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-10-14 18:13:43,292 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 41 [2024-10-14 18:13:43,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:43,292 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-10-14 18:13:43,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:13:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-10-14 18:13:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:13:43,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:43,293 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:43,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-14 18:13:43,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-14 18:13:43,494 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:43,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:43,494 INFO L85 PathProgramCache]: Analyzing trace with hash -730373651, now seen corresponding path program 1 times [2024-10-14 18:13:43,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:43,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777596643] [2024-10-14 18:13:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:43,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:44,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:44,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:44,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:13:44,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:44,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777596643] [2024-10-14 18:13:44,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777596643] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:44,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622291538] [2024-10-14 18:13:44,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:44,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:44,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:44,438 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:13:44,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 18:13:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:44,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-14 18:13:44,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:44,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-10-14 18:13:44,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2024-10-14 18:13:44,886 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:13:44,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:13:45,014 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_65| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_65|) 0) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_65| 1)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_65| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_65|))))) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0))) is different from true [2024-10-14 18:13:45,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:45,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-14 18:13:45,051 INFO L349 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2024-10-14 18:13:45,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2024-10-14 18:13:45,165 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:13:45,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:13:45,210 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 37 treesize of output 13 [2024-10-14 18:13:45,257 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 18 treesize of output 10 [2024-10-14 18:13:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-10-14 18:13:45,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:45,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622291538] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:45,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:13:45,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2024-10-14 18:13:45,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767559426] [2024-10-14 18:13:45,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:45,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 18:13:45,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:45,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 18:13:45,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=959, Unknown=1, NotChecked=62, Total=1122 [2024-10-14 18:13:45,461 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 31 states, 25 states have (on average 2.64) internal successors, (66), 27 states have internal predecessors, (66), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:13:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:46,168 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-10-14 18:13:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 18:13:46,168 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.64) internal successors, (66), 27 states have internal predecessors, (66), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-10-14 18:13:46,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:46,169 INFO L225 Difference]: With dead ends: 85 [2024-10-14 18:13:46,169 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 18:13:46,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=170, Invalid=1555, Unknown=1, NotChecked=80, Total=1806 [2024-10-14 18:13:46,170 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:46,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 661 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 654 Invalid, 0 Unknown, 89 Unchecked, 0.4s Time] [2024-10-14 18:13:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 18:13:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-14 18:13:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.423728813559322) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-10-14 18:13:46,176 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 42 [2024-10-14 18:13:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:46,177 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-10-14 18:13:46,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.64) internal successors, (66), 27 states have internal predecessors, (66), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:13:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-10-14 18:13:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:13:46,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:46,178 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:46,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-14 18:13:46,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:46,382 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:46,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash -730373650, now seen corresponding path program 1 times [2024-10-14 18:13:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:46,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977379267] [2024-10-14 18:13:46,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:47,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:47,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:13:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:47,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977379267] [2024-10-14 18:13:47,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977379267] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545150613] [2024-10-14 18:13:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:47,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:47,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:47,728 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:13:47,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-14 18:13:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:48,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-14 18:13:48,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:48,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-10-14 18:13:48,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-10-14 18:13:48,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-14 18:13:48,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 18:13:48,397 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:13:48,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:13:48,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:48,601 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 45 treesize of output 34 [2024-10-14 18:13:48,613 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-10-14 18:13:48,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-10-14 18:13:48,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-10-14 18:13:48,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-14 18:13:48,813 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:13:48,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:13:48,856 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 35 treesize of output 19 [2024-10-14 18:13:48,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-10-14 18:13:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:48,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:49,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545150613] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:49,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:13:49,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2024-10-14 18:13:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868480053] [2024-10-14 18:13:49,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:49,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-14 18:13:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:49,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-14 18:13:49,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1752, Unknown=0, NotChecked=0, Total=1892 [2024-10-14 18:13:49,168 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 40 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:13:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:50,464 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-10-14 18:13:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 18:13:50,464 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2024-10-14 18:13:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:50,465 INFO L225 Difference]: With dead ends: 84 [2024-10-14 18:13:50,465 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 18:13:50,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=219, Invalid=2643, Unknown=0, NotChecked=0, Total=2862 [2024-10-14 18:13:50,466 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:50,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1032 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 18:13:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 18:13:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 18:13:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-10-14 18:13:50,468 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 42 [2024-10-14 18:13:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:50,468 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-10-14 18:13:50,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:13:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-10-14 18:13:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 18:13:50,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:50,469 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:50,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-14 18:13:50,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:50,670 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:50,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash 625228190, now seen corresponding path program 1 times [2024-10-14 18:13:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340998341] [2024-10-14 18:13:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:50,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:50,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:50,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-14 18:13:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:50,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340998341] [2024-10-14 18:13:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340998341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:50,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 18:13:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910415458] [2024-10-14 18:13:50,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:50,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 18:13:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:50,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 18:13:50,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:13:50,851 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 10 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:51,006 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-10-14 18:13:51,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:13:51,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-10-14 18:13:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:51,007 INFO L225 Difference]: With dead ends: 85 [2024-10-14 18:13:51,007 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 18:13:51,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 18:13:51,007 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:51,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 288 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 18:13:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-10-14 18:13:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-10-14 18:13:51,009 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 46 [2024-10-14 18:13:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:51,010 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-10-14 18:13:51,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-10-14 18:13:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 18:13:51,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:51,010 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:51,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 18:13:51,010 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:51,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:51,011 INFO L85 PathProgramCache]: Analyzing trace with hash 625228191, now seen corresponding path program 1 times [2024-10-14 18:13:51,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:51,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852471860] [2024-10-14 18:13:51,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:51,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:51,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:51,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:51,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 18:13:51,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:51,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852471860] [2024-10-14 18:13:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852471860] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:51,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293291311] [2024-10-14 18:13:51,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:51,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:51,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:51,394 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:13:51,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-14 18:13:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:51,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 18:13:51,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:51,659 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-10-14 18:13:51,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:13:51,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:13:51,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 18:13:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:13:51,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:13:51,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293291311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:51,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:13:51,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 18 [2024-10-14 18:13:51,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752582177] [2024-10-14 18:13:51,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:51,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 18:13:51,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:51,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 18:13:51,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2024-10-14 18:13:51,802 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 10 states, 7 states have (on average 5.0) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:51,948 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-10-14 18:13:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:13:51,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 5.0) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-10-14 18:13:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:51,949 INFO L225 Difference]: With dead ends: 83 [2024-10-14 18:13:51,949 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 18:13:51,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2024-10-14 18:13:51,950 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 32 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:51,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 335 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 18:13:51,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-10-14 18:13:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-10-14 18:13:51,952 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 46 [2024-10-14 18:13:51,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:51,952 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-10-14 18:13:51,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 5.0) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-10-14 18:13:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 18:13:51,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:51,953 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:51,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-14 18:13:52,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-14 18:13:52,153 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:52,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1100081193, now seen corresponding path program 1 times [2024-10-14 18:13:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:52,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822696295] [2024-10-14 18:13:52,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:52,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:53,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:53,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:53,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:13:53,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:53,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822696295] [2024-10-14 18:13:53,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822696295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:53,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:53,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-10-14 18:13:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390254159] [2024-10-14 18:13:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:53,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 18:13:53,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:53,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 18:13:53,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2024-10-14 18:13:53,273 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 24 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:53,784 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-10-14 18:13:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 18:13:53,784 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2024-10-14 18:13:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:53,785 INFO L225 Difference]: With dead ends: 88 [2024-10-14 18:13:53,785 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 18:13:53,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2024-10-14 18:13:53,786 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:53,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 607 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:13:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 18:13:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2024-10-14 18:13:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 74 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:13:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-10-14 18:13:53,788 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 49 [2024-10-14 18:13:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:53,788 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-10-14 18:13:53,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-10-14 18:13:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 18:13:53,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:53,789 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:53,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 18:13:53,789 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:13:53,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1100081192, now seen corresponding path program 1 times [2024-10-14 18:13:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830770348] [2024-10-14 18:13:53,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:55,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:13:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:13:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:55,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:13:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:13:55,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:55,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830770348] [2024-10-14 18:13:55,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830770348] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:55,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745137350] [2024-10-14 18:13:55,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:55,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:55,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:55,496 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:13:55,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-14 18:13:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:55,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-10-14 18:13:55,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:55,786 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-10-14 18:13:55,788 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-10-14 18:13:55,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-10-14 18:13:56,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2024-10-14 18:13:56,035 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:13:56,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:13:56,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:13:56,242 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:13:56,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-14 18:13:56,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:56,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-14 18:13:56,268 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-10-14 18:13:56,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-10-14 18:13:56,652 INFO L349 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2024-10-14 18:13:56,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 29 [2024-10-14 18:13:56,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-10-14 18:13:56,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:13:56,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-10-14 18:13:56,802 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-10-14 18:13:56,803 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 73 treesize of output 56 [2024-10-14 18:13:56,805 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 12 treesize of output 8 [2024-10-14 18:13:56,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:13:56,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-10-14 18:13:56,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:13:56,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 29 [2024-10-14 18:13:56,935 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 55 treesize of output 19 [2024-10-14 18:13:56,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2024-10-14 18:13:56,991 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 44 treesize of output 28 [2024-10-14 18:13:57,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:13:57,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:13:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:57,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:57,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_4927 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4924) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4927))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse2) .cse3) 8))) (forall ((v_ArrVal_4927 (Array Int Int)) (v_ArrVal_4930 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4924 (Array Int Int)) (v_ArrVal_4925 (Array Int Int)) (v_ArrVal_4926 (Array Int Int))) (<= (+ (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4924) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4927))) (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse2) .cse3) 12) (select |c_#length| (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4925) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4926))) (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 v_ArrVal_4930))) .cse2) .cse3)))))) is different from false [2024-10-14 18:13:57,559 INFO L349 Elim1Store]: treesize reduction 31, result has 58.1 percent of original size [2024-10-14 18:13:57,559 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 2 case distinctions, treesize of input 1330 treesize of output 1284 [2024-10-14 18:13:57,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:13:57,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2598 treesize of output 2586 [2024-10-14 18:13:57,599 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 1684 treesize of output 1654 [2024-10-14 18:13:57,616 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 2182 treesize of output 2122 [2024-10-14 18:13:57,880 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 55 treesize of output 49 [2024-10-14 18:13:58,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:13:58,063 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 271 treesize of output 269 [2024-10-14 18:13:58,094 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:13:58,095 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:13:58,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:13:58,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:13:58,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2024-10-14 18:13:58,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:13:58,103 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:13:58,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-10-14 18:13:58,107 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:13:58,108 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-14 18:13:58,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (.cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse0)) (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (<= 0 (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 8)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_prenex_7 (Array Int Int))) (<= (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 12) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_prenex_6)) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_4930 Int) (v_ArrVal_4925 (Array Int Int)) (v_ArrVal_4926 (Array Int Int))) (< (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 11) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4925) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4926) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4925) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4926) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4930)) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2024-10-14 18:13:58,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (.cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse0)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_prenex_7 (Array Int Int))) (<= (+ .cse1 12) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_prenex_7) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse2 v_prenex_7) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_prenex_6)) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (<= 0 (+ .cse1 8)) (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_4930 Int) (v_ArrVal_4925 (Array Int Int)) (v_ArrVal_4926 (Array Int Int))) (< (+ .cse1 11) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_4925) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4926) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse2 v_ArrVal_4925) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4926) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4930)) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) (not (= .cse0 .cse2))))) is different from false [2024-10-14 18:13:59,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745137350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:59,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:13:59,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 44 [2024-10-14 18:13:59,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471249987] [2024-10-14 18:13:59,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:59,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-14 18:13:59,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:59,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-14 18:13:59,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2779, Unknown=37, NotChecked=324, Total=3306 [2024-10-14 18:13:59,705 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 45 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 39 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:14:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:01,455 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2024-10-14 18:14:01,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 18:14:01,455 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 39 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2024-10-14 18:14:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:01,456 INFO L225 Difference]: With dead ends: 90 [2024-10-14 18:14:01,456 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 18:14:01,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=297, Invalid=4644, Unknown=41, NotChecked=420, Total=5402 [2024-10-14 18:14:01,458 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 50 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:01,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1133 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 18:14:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 18:14:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2024-10-14 18:14:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:14:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-10-14 18:14:01,460 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 49 [2024-10-14 18:14:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:01,460 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-10-14 18:14:01,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 39 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:14:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-10-14 18:14:01,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 18:14:01,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:01,461 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:01,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-14 18:14:01,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-14 18:14:01,665 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:14:01,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash 257125937, now seen corresponding path program 1 times [2024-10-14 18:14:01,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:01,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120075769] [2024-10-14 18:14:01,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:01,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:02,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:14:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:02,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:14:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:02,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:14:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:14:03,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:03,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120075769] [2024-10-14 18:14:03,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120075769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:03,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822250916] [2024-10-14 18:14:03,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:03,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:03,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:03,159 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:03,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-14 18:14:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:03,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-10-14 18:14:03,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:03,448 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-10-14 18:14:03,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2024-10-14 18:14:03,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2024-10-14 18:14:03,625 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:14:03,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:14:03,719 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-10-14 18:14:03,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:03,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-10-14 18:14:03,771 INFO L349 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2024-10-14 18:14:03,771 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 34 treesize of output 36 [2024-10-14 18:14:03,945 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:14:03,949 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2024-10-14 18:14:03,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 11 [2024-10-14 18:14:04,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:14:04,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-14 18:14:04,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:04,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:14:04,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:14:04,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:14:04,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 21 [2024-10-14 18:14:04,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-14 18:14:04,216 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 21 treesize of output 13 [2024-10-14 18:14:04,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-14 18:14:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:14:04,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:04,327 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5245 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5244))) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 (select v_ArrVal_5245 .cse1))) v_ArrVal_5245)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5245) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2024-10-14 18:14:04,334 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5245 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5243) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5244))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5245) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 (select v_ArrVal_5245 .cse1))) v_ArrVal_5245))))) is different from false [2024-10-14 18:14:04,341 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5245 (Array Int Int)) (v_ArrVal_5242 Int)) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_5242)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5243) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse0 (select v_ArrVal_5245 .cse0))) v_ArrVal_5245)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5243) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5245) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-10-14 18:14:04,351 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5245 (Array Int Int)) (v_ArrVal_5242 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5243) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5245) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_5242)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5243) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse0 (select v_ArrVal_5245 .cse0))) v_ArrVal_5245)))) is different from false [2024-10-14 18:14:04,362 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5245 (Array Int Int)) (v_ArrVal_5242 Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (not (= v_ArrVal_5245 (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_5242)) .cse0 v_ArrVal_5243) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 (select v_ArrVal_5245 .cse1))))) (= (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_5243) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5245) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~uneq~0#1|))))) is different from false [2024-10-14 18:14:04,404 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5245 (Array Int Int)) (v_ArrVal_5242 Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 4)))) (or (not (= v_ArrVal_5245 (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_5242)) .cse0 v_ArrVal_5243) .cse1 v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 (select v_ArrVal_5245 .cse2))))) (= (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_5243) .cse1 v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5245) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~uneq~0#1|))))) is different from false [2024-10-14 18:14:04,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5245 (Array Int Int)) (v_ArrVal_5242 Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (= (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_5243) .cse1 v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5245) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_5242)) .cse0 v_ArrVal_5243) .cse1 v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse4 (select v_ArrVal_5245 .cse4))) v_ArrVal_5245))))))) is different from false [2024-10-14 18:14:04,454 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5244 (Array Int Int)) (v_ArrVal_5243 (Array Int Int)) (v_ArrVal_5245 (Array Int Int)) (v_ArrVal_5242 Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (= (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_5243) .cse1 v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_5245) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_5245 (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| v_ArrVal_5242)) .cse0 v_ArrVal_5243) .cse1 v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse4 (select v_ArrVal_5245 .cse4)))))))))) is different from false [2024-10-14 18:14:04,562 INFO L349 Elim1Store]: treesize reduction 167, result has 42.2 percent of original size [2024-10-14 18:14:04,562 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 3 case distinctions, treesize of input 2003 treesize of output 1991 [2024-10-14 18:14:04,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:04,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2077 treesize of output 2065 [2024-10-14 18:14:04,617 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 1212 treesize of output 1132 [2024-10-14 18:14:04,633 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 1420 treesize of output 1260 [2024-10-14 18:14:04,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 4 [2024-10-14 18:14:05,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:05,028 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 1203 treesize of output 1139 [2024-10-14 18:14:05,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822250916] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:05,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:14:05,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 49 [2024-10-14 18:14:05,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705762704] [2024-10-14 18:14:05,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:05,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-14 18:14:05,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:05,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-14 18:14:05,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2389, Unknown=19, NotChecked=840, Total=3422 [2024-10-14 18:14:05,427 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 49 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 42 states have internal predecessors, (81), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:14:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:06,266 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-10-14 18:14:06,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 18:14:06,266 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 42 states have internal predecessors, (81), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2024-10-14 18:14:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:06,267 INFO L225 Difference]: With dead ends: 82 [2024-10-14 18:14:06,267 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 18:14:06,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=233, Invalid=3200, Unknown=21, NotChecked=968, Total=4422 [2024-10-14 18:14:06,268 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:06,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1198 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 18:14:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 18:14:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 18:14:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:14:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-10-14 18:14:06,270 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 50 [2024-10-14 18:14:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:06,270 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-10-14 18:14:06,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 42 states have internal predecessors, (81), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:14:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-10-14 18:14:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 18:14:06,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:06,271 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:06,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:06,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-14 18:14:06,476 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-14 18:14:06,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:06,476 INFO L85 PathProgramCache]: Analyzing trace with hash 663247227, now seen corresponding path program 1 times [2024-10-14 18:14:06,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:06,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808088830] [2024-10-14 18:14:06,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:06,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:08,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:14:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:08,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 18:14:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:08,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:14:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:14:08,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:08,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808088830] [2024-10-14 18:14:08,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808088830] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:08,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675515863] [2024-10-14 18:14:08,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:08,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:08,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:08,955 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:08,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-14 18:14:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:09,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 134 conjuncts are in the unsatisfiable core [2024-10-14 18:14:09,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:09,297 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-10-14 18:14:09,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:14:09,586 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 18:14:09,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 18:14:09,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 18:14:09,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:14:09,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:14:09,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-10-14 18:14:09,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-10-14 18:14:10,048 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 30 treesize of output 14 [2024-10-14 18:14:10,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:14:10,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 18:14:10,331 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:14:10,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-14 18:14:10,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:10,339 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 38 treesize of output 27 [2024-10-14 18:14:10,353 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 18:14:10,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-14 18:14:10,915 INFO L349 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2024-10-14 18:14:10,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 29 [2024-10-14 18:14:10,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 45 [2024-10-14 18:14:10,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-10-14 18:14:11,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:14:11,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:14:11,108 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-10-14 18:14:11,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 79 [2024-10-14 18:14:11,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:14:11,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:14:11,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-10-14 18:14:11,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-14 18:14:11,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:14:11,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-14 18:14:11,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-10-14 18:14:11,292 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 79 treesize of output 31 [2024-10-14 18:14:11,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-10-14 18:14:11,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2024-10-14 18:14:11,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-10-14 18:14:11,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-14 18:14:11,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:14:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:11,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:11,840 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5572 (Array Int Int)) (v_ArrVal_5574 (Array Int Int)) (v_ArrVal_5573 (Array Int Int)) (v_ArrVal_5577 (Array Int Int)) (v_ArrVal_5578 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5573) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5577) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5572))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 v_ArrVal_5578))) .cse2) .cse3)) (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5574))) (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse2) .cse3) 8))))) is different from false [2024-10-14 18:14:11,851 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5572 (Array Int Int)) (v_ArrVal_5574 (Array Int Int)) (v_ArrVal_5573 (Array Int Int)) (v_ArrVal_5577 (Array Int Int)) (v_ArrVal_5569 (Array Int Int)) (v_ArrVal_5578 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_5570 (Array Int Int)) (v_ArrVal_5571 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 4) v_ArrVal_5571)) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5573) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5577) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5572))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 v_ArrVal_5578))) .cse2) .cse3)) (+ (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5570) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5574))) (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse2) .cse3) 8))))) is different from false [2024-10-14 18:14:11,886 INFO L349 Elim1Store]: treesize reduction 31, result has 58.1 percent of original size [2024-10-14 18:14:11,887 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 2 case distinctions, treesize of input 1666 treesize of output 1620 [2024-10-14 18:14:11,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:11,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1890 treesize of output 1886 [2024-10-14 18:14:11,911 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 2536 treesize of output 2476 [2024-10-14 18:14:11,923 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 2824 treesize of output 2794 [2024-10-14 18:14:11,946 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 10 treesize of output 4 [2024-10-14 18:14:13,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:13,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:13,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:13,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:13,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:13,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:13,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:13,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:14,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:14,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:14,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:14,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:14,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:14,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:14,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:14,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:14,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:14,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:14,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:14,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:14,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:14,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:14,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:14,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:15,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:15,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:15,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:15,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:15,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:15,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:15,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:15,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:15,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:15,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:15,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:15,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:15,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:15,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:15,643 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:14:18,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:18,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 607 treesize of output 575 [2024-10-14 18:14:18,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:18,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 150 [2024-10-14 18:14:18,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:18,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:20,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:20,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:20,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:20,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:20,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 249 [2024-10-14 18:14:20,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:20,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:20,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 249 [2024-10-14 18:14:20,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:20,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:20,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:20,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:20,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:20,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:20,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 249 [2024-10-14 18:14:21,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:21,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:21,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:21,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:21,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:21,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:21,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:21,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:21,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:21,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:21,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:21,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:21,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:21,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:22,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:22,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:22,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:22,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:22,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:22,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:22,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:22,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 249 [2024-10-14 18:14:22,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 249 [2024-10-14 18:14:22,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:22,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 249 [2024-10-14 18:14:22,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:22,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 249 [2024-10-14 18:14:22,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:22,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:22,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 249 [2024-10-14 18:14:23,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:23,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:23,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:23,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:23,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:23,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:23,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:23,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:23,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:23,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 249 [2024-10-14 18:14:23,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:23,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:23,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:23,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 249 [2024-10-14 18:14:24,115 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:14:24,126 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:14:24,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:24,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:24,241 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:14:24,253 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:14:24,267 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:14:24,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:24,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:24,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:24,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:24,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:24,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 255 [2024-10-14 18:14:24,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:24,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 255 [2024-10-14 18:14:24,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:24,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:24,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:24,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:24,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:24,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 255 [2024-10-14 18:14:25,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:25,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 135 [2024-10-14 18:14:25,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:25,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:25,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 135 [2024-10-14 18:14:25,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 135 [2024-10-14 18:14:25,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:25,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:25,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:25,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:25,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:25,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 255 [2024-10-14 18:14:25,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:25,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 255 [2024-10-14 18:14:25,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:25,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:25,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 135 [2024-10-14 18:14:25,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:25,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 255 [2024-10-14 18:14:25,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 195 [2024-10-14 18:14:25,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:25,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 255 [2024-10-14 18:14:26,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:26,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:26,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:26,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:26,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:26,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:26,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:26,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:26,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:26,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:26,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:26,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:26,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:26,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:26,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:26,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:26,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:26,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:26,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:26,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:26,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:26,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:27,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:27,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:27,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:27,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:27,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:27,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:27,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:27,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:27,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:27,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:27,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:27,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 189 [2024-10-14 18:14:27,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:27,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:27,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:27,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-10-14 18:14:27,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:27,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-10-14 18:14:27,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:27,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69