./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/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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/sll2n_insert_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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:01:59,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:01:59,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:01:59,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:01:59,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:01:59,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:01:59,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:01:59,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:01:59,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:01:59,206 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:01:59,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:01:59,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:01:59,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:01:59,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:01:59,208 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:01:59,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:01:59,212 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:01:59,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:01:59,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:01:59,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:01:59,212 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:01:59,213 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:01:59,213 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:01:59,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:01:59,213 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:01:59,214 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:01:59,214 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:01:59,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:01:59,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:01:59,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:01:59,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:01:59,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:01:59,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:01:59,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:01:59,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:01:59,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:01:59,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:01:59,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:01:59,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:01:59,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:01:59,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:01:59,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:01:59,219 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2024-10-13 11:01:59,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:01:59,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:01:59,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:01:59,517 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:01:59,518 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:01:59,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-10-13 11:02:00,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:02:01,124 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:02:01,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-10-13 11:02:01,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef765d1a/26839c2db17a483dac91ed18e1f30202/FLAGcabd61218 [2024-10-13 11:02:01,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef765d1a/26839c2db17a483dac91ed18e1f30202 [2024-10-13 11:02:01,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:02:01,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:02:01,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:02:01,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:02:01,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:02:01,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65cd057e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01, skipping insertion in model container [2024-10-13 11:02:01,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:02:01,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:02:01,514 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:02:01,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:02:01,593 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:02:01,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01 WrapperNode [2024-10-13 11:02:01,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:02:01,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:02:01,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:02:01,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:02:01,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,645 INFO L138 Inliner]: procedures = 128, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 156 [2024-10-13 11:02:01,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:02:01,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:02:01,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:02:01,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:02:01,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,687 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 13, 5]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2024-10-13 11:02:01,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:02:01,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:02:01,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:02:01,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:02:01,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (1/1) ... [2024-10-13 11:02:01,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:02:01,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:01,759 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-13 11:02:01,765 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-13 11:02:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 11:02:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 11:02:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 11:02:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 11:02:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 11:02:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 11:02:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-13 11:02:01,813 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-13 11:02:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:02:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:02:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:02:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:02:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:02:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:02:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:02:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:02:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:02:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:02:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 11:02:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 11:02:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 11:02:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 11:02:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 11:02:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 11:02:01,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:02:01,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:02:02,035 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:02:02,038 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:02:02,418 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-13 11:02:02,418 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:02:02,479 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:02:02,479 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-13 11:02:02,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:02:02 BoogieIcfgContainer [2024-10-13 11:02:02,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:02:02,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:02:02,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:02:02,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:02:02,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:02:01" (1/3) ... [2024-10-13 11:02:02,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4d761f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:02:02, skipping insertion in model container [2024-10-13 11:02:02,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:01" (2/3) ... [2024-10-13 11:02:02,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4d761f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:02:02, skipping insertion in model container [2024-10-13 11:02:02,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:02:02" (3/3) ... [2024-10-13 11:02:02,489 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2024-10-13 11:02:02,506 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:02:02,506 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-10-13 11:02:02,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:02:02,563 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;@191af8e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:02:02,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-10-13 11:02:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 43 states have (on average 2.302325581395349) internal successors, (99), 82 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:02:02,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:02,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:02:02,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:02,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:02,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1875584206, now seen corresponding path program 1 times [2024-10-13 11:02:02,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:02,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459778863] [2024-10-13 11:02:02,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:02,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:02,846 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-13 11:02:02,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459778863] [2024-10-13 11:02:02,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459778863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:02,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:02,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:02:02,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971910427] [2024-10-13 11:02:02,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:02,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:02:02,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:02,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:02:02,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:02,888 INFO L87 Difference]: Start difference. First operand has 86 states, 43 states have (on average 2.302325581395349) internal successors, (99), 82 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 11:02:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:03,006 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2024-10-13 11:02:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:02:03,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-10-13 11:02:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:03,016 INFO L225 Difference]: With dead ends: 83 [2024-10-13 11:02:03,016 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 11:02:03,019 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-13 11:02:03,024 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:03,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 11:02:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-13 11:02:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 41 states have (on average 2.097560975609756) internal successors, (86), 77 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-10-13 11:02:03,057 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 6 [2024-10-13 11:02:03,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:03,058 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-10-13 11:02:03,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 11:02:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-10-13 11:02:03,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:02:03,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:03,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:02:03,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 11:02:03,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:03,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:03,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1875584205, now seen corresponding path program 1 times [2024-10-13 11:02:03,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:03,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732014738] [2024-10-13 11:02:03,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:03,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:03,204 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-13 11:02:03,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:03,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732014738] [2024-10-13 11:02:03,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732014738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:03,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:03,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:02:03,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633051743] [2024-10-13 11:02:03,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:03,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:02:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:03,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:02:03,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:03,208 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 11:02:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:03,311 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2024-10-13 11:02:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:02:03,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-10-13 11:02:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:03,313 INFO L225 Difference]: With dead ends: 79 [2024-10-13 11:02:03,314 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 11:02:03,314 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-13 11:02:03,315 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:03,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 125 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 11:02:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 11:02:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 41 states have (on average 2.048780487804878) internal successors, (84), 75 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-10-13 11:02:03,331 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 6 [2024-10-13 11:02:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:03,331 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-10-13 11:02:03,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 11:02:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2024-10-13 11:02:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 11:02:03,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:03,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:03,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 11:02:03,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:03,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:03,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1734646529, now seen corresponding path program 1 times [2024-10-13 11:02:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:03,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13089670] [2024-10-13 11:02:03,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:03,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:03,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:03,628 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-13 11:02:03,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:03,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13089670] [2024-10-13 11:02:03,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13089670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:03,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:03,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:02:03,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737919536] [2024-10-13 11:02:03,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:03,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:02:03,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:03,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:02:03,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:02:03,633 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-13 11:02:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:03,874 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2024-10-13 11:02:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:03,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2024-10-13 11:02:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:03,876 INFO L225 Difference]: With dead ends: 78 [2024-10-13 11:02:03,876 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 11:02:03,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-13 11:02:03,878 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:03,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 273 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:02:03,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 11:02:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 11:02:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 41 states have (on average 2.024390243902439) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-10-13 11:02:03,892 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2024-10-13 11:02:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:03,893 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-10-13 11:02:03,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-13 11:02:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-10-13 11:02:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 11:02:03,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:03,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:03,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 11:02:03,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:03,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1734646530, now seen corresponding path program 1 times [2024-10-13 11:02:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:03,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532257955] [2024-10-13 11:02:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:04,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:04,189 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-13 11:02:04,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:04,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532257955] [2024-10-13 11:02:04,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532257955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:04,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:04,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:02:04,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652886266] [2024-10-13 11:02:04,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:04,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:02:04,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:04,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:02:04,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:02:04,194 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-13 11:02:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:04,369 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2024-10-13 11:02:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:04,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2024-10-13 11:02:04,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:04,371 INFO L225 Difference]: With dead ends: 77 [2024-10-13 11:02:04,371 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 11:02:04,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-13 11:02:04,373 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:04,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:02:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 11:02:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 11:02:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 41 states have (on average 2.0) internal successors, (82), 73 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2024-10-13 11:02:04,385 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 10 [2024-10-13 11:02:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:04,385 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2024-10-13 11:02:04,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-13 11:02:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2024-10-13 11:02:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 11:02:04,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:04,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:04,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 11:02:04,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:04,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1073352494, now seen corresponding path program 1 times [2024-10-13 11:02:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:04,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262537363] [2024-10-13 11:02:04,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:04,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:04,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 11:02:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:04,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:04,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262537363] [2024-10-13 11:02:04,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262537363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:04,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:04,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:02:04,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019029716] [2024-10-13 11:02:04,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:04,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:02:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:04,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:02:04,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:02:04,460 INFO L87 Difference]: Start difference. First operand 77 states and 86 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-13 11:02:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:04,549 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2024-10-13 11:02:04,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:02:04,549 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-13 11:02:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:04,550 INFO L225 Difference]: With dead ends: 81 [2024-10-13 11:02:04,550 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 11:02:04,550 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-13 11:02:04,551 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:04,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 172 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 11:02:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2024-10-13 11:02:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-10-13 11:02:04,557 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 11 [2024-10-13 11:02:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:04,558 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-10-13 11:02:04,558 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-13 11:02:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-10-13 11:02:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 11:02:04,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:04,559 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:04,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 11:02:04,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:04,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1733147860, now seen corresponding path program 1 times [2024-10-13 11:02:04,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:04,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679432087] [2024-10-13 11:02:04,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:04,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:04,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 11:02:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 11:02:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679432087] [2024-10-13 11:02:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679432087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288251578] [2024-10-13 11:02:04,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:04,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:04,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:04,701 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-13 11:02:04,703 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-13 11:02:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:04,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:02:04,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:04,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 11:02:04,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288251578] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:04,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:04,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-10-13 11:02:04,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962497326] [2024-10-13 11:02:04,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:04,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:02:04,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:04,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:02:04,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:04,923 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 11:02:05,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:05,016 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2024-10-13 11:02:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:02:05,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-10-13 11:02:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:05,018 INFO L225 Difference]: With dead ends: 82 [2024-10-13 11:02:05,018 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 11:02:05,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:05,019 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:05,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 171 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 11:02:05,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-13 11:02:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 77 states have internal predecessors, (86), 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-13 11:02:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2024-10-13 11:02:05,031 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 20 [2024-10-13 11:02:05,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:05,031 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2024-10-13 11:02:05,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 11:02:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2024-10-13 11:02:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:02:05,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:05,032 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:05,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:05,233 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-13 11:02:05,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:05,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:05,234 INFO L85 PathProgramCache]: Analyzing trace with hash 697562642, now seen corresponding path program 2 times [2024-10-13 11:02:05,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:05,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608951020] [2024-10-13 11:02:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:05,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:05,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:05,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:05,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:02:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608951020] [2024-10-13 11:02:05,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608951020] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356621163] [2024-10-13 11:02:05,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:02:05,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:05,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:05,853 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-13 11:02:05,857 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-13 11:02:06,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:02:06,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:02:06,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 11:02:06,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:06,047 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-13 11:02:06,070 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-13 11:02:06,158 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 11:02:06,159 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-13 11:02:06,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-13 11:02:06,272 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-13 11:02:06,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:06,322 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-13 11:02:06,373 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-13 11:02:06,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:06,429 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-13 11:02:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 8 not checked. [2024-10-13 11:02:06,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:06,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356621163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:06,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:02:06,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-10-13 11:02:06,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938206279] [2024-10-13 11:02:06,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:06,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 11:02:06,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:06,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 11:02:06,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-10-13 11:02:06,506 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 17 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 11:02:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:06,820 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2024-10-13 11:02:06,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:06,821 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2024-10-13 11:02:06,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:06,822 INFO L225 Difference]: With dead ends: 92 [2024-10-13 11:02:06,822 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 11:02:06,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=308, Unknown=1, NotChecked=36, Total=420 [2024-10-13 11:02:06,823 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 228 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:06,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 235 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 293 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2024-10-13 11:02:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 11:02:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2024-10-13 11:02:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 73 states have internal predecessors, (82), 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-13 11:02:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-10-13 11:02:06,828 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 29 [2024-10-13 11:02:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:06,829 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-10-13 11:02:06,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 11:02:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-10-13 11:02:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:02:06,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:06,830 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:06,845 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-13 11:02:07,034 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-13 11:02:07,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:07,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash 697562643, now seen corresponding path program 1 times [2024-10-13 11:02:07,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:07,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224530794] [2024-10-13 11:02:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:07,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:07,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:07,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:02:07,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:07,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224530794] [2024-10-13 11:02:07,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224530794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:07,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645315951] [2024-10-13 11:02:07,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:07,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:07,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:07,712 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-13 11:02:07,713 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-13 11:02:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:07,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 11:02:07,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:07,882 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-13 11:02:07,913 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-13 11:02:07,939 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-13 11:02:07,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:07,979 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-13 11:02:08,011 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-13 11:02:08,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:08,056 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-13 11:02:08,107 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-13 11:02:08,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:08,136 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-13 11:02:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 11:02:08,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:02:08,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645315951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:08,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:02:08,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-13 11:02:08,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241746829] [2024-10-13 11:02:08,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:08,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:02:08,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:08,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:02:08,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=123, Unknown=1, NotChecked=22, Total=182 [2024-10-13 11:02:08,145 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:08,262 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2024-10-13 11:02:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:08,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-13 11:02:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:08,263 INFO L225 Difference]: With dead ends: 79 [2024-10-13 11:02:08,263 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 11:02:08,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2024-10-13 11:02:08,264 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 14 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:08,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 215 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 101 Unchecked, 0.1s Time] [2024-10-13 11:02:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 11:02:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-10-13 11:02:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 71 states have internal predecessors, (80), 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-13 11:02:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2024-10-13 11:02:08,269 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 29 [2024-10-13 11:02:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:08,269 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2024-10-13 11:02:08,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2024-10-13 11:02:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:02:08,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:08,270 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:08,287 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-13 11:02:08,471 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-13 11:02:08,472 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:08,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash 342973094, now seen corresponding path program 1 times [2024-10-13 11:02:08,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:08,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569950286] [2024-10-13 11:02:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:08,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:08,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:08,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:02:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:08,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569950286] [2024-10-13 11:02:08,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569950286] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:08,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84771592] [2024-10-13 11:02:08,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:08,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:08,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:08,850 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-13 11:02:08,851 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-13 11:02:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:09,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 11:02:09,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:09,124 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-13 11:02:09,221 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-13 11:02:09,240 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-13 11:02:09,259 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-13 11:02:09,260 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 16 treesize of output 18 [2024-10-13 11:02:09,291 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-13 11:02:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2024-10-13 11:02:09,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:09,423 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-13 11:02:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 11:02:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84771592] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:09,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:09,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 19 [2024-10-13 11:02:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629496171] [2024-10-13 11:02:09,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:09,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 11:02:09,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:09,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 11:02:09,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=293, Unknown=1, NotChecked=34, Total=380 [2024-10-13 11:02:09,457 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 20 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-13 11:02:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:09,901 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2024-10-13 11:02:09,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 11:02:09,902 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 31 [2024-10-13 11:02:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:09,903 INFO L225 Difference]: With dead ends: 92 [2024-10-13 11:02:09,903 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 11:02:09,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=559, Unknown=1, NotChecked=48, Total=702 [2024-10-13 11:02:09,904 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 107 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:09,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 501 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 551 Invalid, 0 Unknown, 100 Unchecked, 0.3s Time] [2024-10-13 11:02:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 11:02:09,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2024-10-13 11:02:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 73 states have internal predecessors, (84), 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-13 11:02:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2024-10-13 11:02:09,909 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 31 [2024-10-13 11:02:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:09,909 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2024-10-13 11:02:09,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-13 11:02:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2024-10-13 11:02:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:02:09,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:09,910 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:09,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 11:02:10,114 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-13 11:02:10,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:10,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:10,115 INFO L85 PathProgramCache]: Analyzing trace with hash 342973095, now seen corresponding path program 1 times [2024-10-13 11:02:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:10,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307007061] [2024-10-13 11:02:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:10,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:10,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:10,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 11:02:10,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:10,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307007061] [2024-10-13 11:02:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307007061] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:10,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049812394] [2024-10-13 11:02:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:10,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:10,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:10,570 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-13 11:02:10,572 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-13 11:02:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:10,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-13 11:02:10,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:10,834 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 0 case distinctions, treesize of input 12 treesize of output 9 [2024-10-13 11:02:10,838 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-13 11:02:11,039 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-13 11:02:11,043 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-13 11:02:11,080 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_5|) 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-13 11:02:11,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:11,111 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-13 11:02:11,121 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-13 11:02:11,121 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-13 11:02:11,174 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-13 11:02:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2024-10-13 11:02:11,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049812394] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:11,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:02:11,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2024-10-13 11:02:11,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189363766] [2024-10-13 11:02:11,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:11,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 11:02:11,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:11,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 11:02:11,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=540, Unknown=1, NotChecked=46, Total=650 [2024-10-13 11:02:11,412 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 23 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 11:02:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:12,340 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2024-10-13 11:02:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 11:02:12,341 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2024-10-13 11:02:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:12,342 INFO L225 Difference]: With dead ends: 97 [2024-10-13 11:02:12,342 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 11:02:12,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=1332, Unknown=1, NotChecked=74, Total=1560 [2024-10-13 11:02:12,343 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 140 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:12,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 679 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 854 Invalid, 0 Unknown, 103 Unchecked, 0.5s Time] [2024-10-13 11:02:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 11:02:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2024-10-13 11:02:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 77 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-13 11:02:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2024-10-13 11:02:12,351 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 31 [2024-10-13 11:02:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:12,351 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-10-13 11:02:12,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 11:02:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2024-10-13 11:02:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 11:02:12,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:12,356 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:12,377 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-13 11:02:12,556 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-13 11:02:12,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:12,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2042229699, now seen corresponding path program 1 times [2024-10-13 11:02:12,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:12,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276101802] [2024-10-13 11:02:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:12,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:12,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:12,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:12,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 11:02:12,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276101802] [2024-10-13 11:02:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276101802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:12,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:12,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:02:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792789417] [2024-10-13 11:02:12,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:12,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:02:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:12,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:02:12,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:02:12,691 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:02:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:12,787 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2024-10-13 11:02:12,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:02:12,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-13 11:02:12,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:12,790 INFO L225 Difference]: With dead ends: 84 [2024-10-13 11:02:12,790 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 11:02:12,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-13 11:02:12,791 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:12,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 11:02:12,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 11:02:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.6923076923076923) internal successors, (88), 78 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:02:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2024-10-13 11:02:12,797 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 32 [2024-10-13 11:02:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:12,797 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2024-10-13 11:02:12,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:02:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2024-10-13 11:02:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:02:12,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:12,798 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:12,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 11:02:12,800 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:12,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:12,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1115383782, now seen corresponding path program 1 times [2024-10-13 11:02:12,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:12,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118965766] [2024-10-13 11:02:12,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:12,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:12,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:12,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 11:02:12,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:12,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118965766] [2024-10-13 11:02:12,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118965766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:12,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:12,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:02:12,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527459111] [2024-10-13 11:02:12,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:12,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:02:12,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:02:12,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:02:12,959 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-13 11:02:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:13,104 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2024-10-13 11:02:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:13,105 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), 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 33 [2024-10-13 11:02:13,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:13,106 INFO L225 Difference]: With dead ends: 83 [2024-10-13 11:02:13,106 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 11:02:13,106 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-13 11:02:13,107 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:13,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 243 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 11:02:13,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 11:02:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 77 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-13 11:02:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2024-10-13 11:02:13,115 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 33 [2024-10-13 11:02:13,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:13,116 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-10-13 11:02:13,116 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), 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-13 11:02:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2024-10-13 11:02:13,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:02:13,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:13,117 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:13,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 11:02:13,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:13,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1115383781, now seen corresponding path program 1 times [2024-10-13 11:02:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:13,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350889518] [2024-10-13 11:02:13,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:13,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:13,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:13,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:13,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 11:02:13,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:13,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350889518] [2024-10-13 11:02:13,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350889518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:13,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:13,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:02:13,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731857669] [2024-10-13 11:02:13,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:13,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:02:13,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:13,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:02:13,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:13,254 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:13,341 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-10-13 11:02:13,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:02:13,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-13 11:02:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:13,342 INFO L225 Difference]: With dead ends: 86 [2024-10-13 11:02:13,343 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 11:02:13,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-13 11:02:13,343 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 53 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:13,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 168 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 11:02:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-10-13 11:02:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 76 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-13 11:02:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2024-10-13 11:02:13,347 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 33 [2024-10-13 11:02:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:13,347 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2024-10-13 11:02:13,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2024-10-13 11:02:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:02:13,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:13,348 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:13,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 11:02:13,348 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:13,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1115186331, now seen corresponding path program 1 times [2024-10-13 11:02:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832445145] [2024-10-13 11:02:13,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:13,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:13,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:13,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:13,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 11:02:13,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832445145] [2024-10-13 11:02:13,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832445145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:13,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:13,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:02:13,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470721794] [2024-10-13 11:02:13,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:13,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:02:13,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:13,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:02:13,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:13,486 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:13,583 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2024-10-13 11:02:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:02:13,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-13 11:02:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:13,584 INFO L225 Difference]: With dead ends: 83 [2024-10-13 11:02:13,584 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 11:02:13,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:02:13,585 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 47 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:13,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 222 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 11:02:13,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-10-13 11:02:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.62) internal successors, (81), 73 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-13 11:02:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-10-13 11:02:13,588 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 33 [2024-10-13 11:02:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:13,588 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-10-13 11:02:13,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-10-13 11:02:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 11:02:13,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:13,589 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:13,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 11:02:13,589 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:13,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:13,590 INFO L85 PathProgramCache]: Analyzing trace with hash -211039516, now seen corresponding path program 1 times [2024-10-13 11:02:13,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:13,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607543369] [2024-10-13 11:02:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:13,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:13,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:13,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:13,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 11:02:13,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:13,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607543369] [2024-10-13 11:02:13,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607543369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:13,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:13,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:02:13,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432431123] [2024-10-13 11:02:13,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:13,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:02:13,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:13,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:02:13,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:13,687 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:02:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:13,778 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-10-13 11:02:13,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:02:13,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-13 11:02:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:13,779 INFO L225 Difference]: With dead ends: 78 [2024-10-13 11:02:13,780 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 11:02:13,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:13,782 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:13,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 11:02:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 11:02:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.6) internal successors, (80), 72 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-13 11:02:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2024-10-13 11:02:13,785 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 34 [2024-10-13 11:02:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:13,787 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2024-10-13 11:02:13,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:02:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2024-10-13 11:02:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 11:02:13,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:13,788 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:13,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 11:02:13,788 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:13,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash -211039515, now seen corresponding path program 1 times [2024-10-13 11:02:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:13,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65200635] [2024-10-13 11:02:13,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:13,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:14,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:14,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:14,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:02:14,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:14,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65200635] [2024-10-13 11:02:14,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65200635] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:14,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690422501] [2024-10-13 11:02:14,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:14,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:14,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:14,082 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-13 11:02:14,083 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-13 11:02:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:14,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 11:02:14,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:14,328 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-13 11:02:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 11:02:14,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:02:14,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690422501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:14,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:02:14,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-13 11:02:14,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237849436] [2024-10-13 11:02:14,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:14,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:02:14,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:14,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:02:14,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-10-13 11:02:14,376 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:14,486 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2024-10-13 11:02:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:02:14,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-10-13 11:02:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:14,487 INFO L225 Difference]: With dead ends: 79 [2024-10-13 11:02:14,487 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 11:02:14,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-10-13 11:02:14,488 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 56 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:14,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 218 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 11:02:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-10-13 11:02:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.58) internal successors, (79), 71 states have internal predecessors, (79), 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-13 11:02:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2024-10-13 11:02:14,491 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 34 [2024-10-13 11:02:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:14,492 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2024-10-13 11:02:14,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2024-10-13 11:02:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 11:02:14,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:14,493 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:14,509 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-13 11:02:14,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 11:02:14,697 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:14,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2047709626, now seen corresponding path program 1 times [2024-10-13 11:02:14,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:14,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968313542] [2024-10-13 11:02:14,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:14,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:14,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:14,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 11:02:14,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:14,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968313542] [2024-10-13 11:02:14,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968313542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:14,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:14,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 11:02:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428144778] [2024-10-13 11:02:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:14,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:02:14,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:14,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:02:14,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:02:14,907 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-13 11:02:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:15,026 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2024-10-13 11:02:15,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:15,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 35 [2024-10-13 11:02:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:15,027 INFO L225 Difference]: With dead ends: 76 [2024-10-13 11:02:15,027 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 11:02:15,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:02:15,028 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:15,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 257 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 11:02:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-13 11:02:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.56) internal successors, (78), 70 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-13 11:02:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-10-13 11:02:15,031 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 35 [2024-10-13 11:02:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:15,031 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-10-13 11:02:15,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-13 11:02:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-10-13 11:02:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 11:02:15,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:15,032 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:15,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 11:02:15,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:15,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:15,033 INFO L85 PathProgramCache]: Analyzing trace with hash -945506783, now seen corresponding path program 1 times [2024-10-13 11:02:15,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:15,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477485857] [2024-10-13 11:02:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:15,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:15,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-13 11:02:15,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:15,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477485857] [2024-10-13 11:02:15,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477485857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:15,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:15,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:02:15,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105693123] [2024-10-13 11:02:15,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:15,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:02:15,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:15,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:02:15,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:02:15,232 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:15,323 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2024-10-13 11:02:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:15,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-10-13 11:02:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:15,324 INFO L225 Difference]: With dead ends: 75 [2024-10-13 11:02:15,324 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 11:02:15,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:02:15,325 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 88 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:15,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 122 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 11:02:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-10-13 11:02:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.52) internal successors, (76), 68 states have internal predecessors, (76), 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-13 11:02:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-10-13 11:02:15,328 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 36 [2024-10-13 11:02:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:15,328 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-10-13 11:02:15,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-10-13 11:02:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 11:02:15,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:15,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:15,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 11:02:15,329 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:15,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:15,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1901179450, now seen corresponding path program 1 times [2024-10-13 11:02:15,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:15,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083986621] [2024-10-13 11:02:15,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:15,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:15,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:15,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:15,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 11:02:15,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:15,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083986621] [2024-10-13 11:02:15,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083986621] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:15,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348328410] [2024-10-13 11:02:15,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:15,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:15,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:15,490 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-13 11:02:15,491 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-13 11:02:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:15,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 11:02:15,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:15,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-13 11:02:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 11:02:15,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:02:16,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348328410] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:16,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:16,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 18 [2024-10-13 11:02:16,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139402135] [2024-10-13 11:02:16,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:16,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 11:02:16,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:16,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 11:02:16,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-13 11:02:16,027 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 11:02:20,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:02:24,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:02:28,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:02:32,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:02:36,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:02:40,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:02:44,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:02:48,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:02:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:48,687 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2024-10-13 11:02:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 11:02:48,687 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2024-10-13 11:02:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:48,688 INFO L225 Difference]: With dead ends: 127 [2024-10-13 11:02:48,688 INFO L226 Difference]: Without dead ends: 127 [2024-10-13 11:02:48,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 11:02:48,689 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 157 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 9 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:48,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 839 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 681 Invalid, 8 Unknown, 0 Unchecked, 32.4s Time] [2024-10-13 11:02:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-13 11:02:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 75. [2024-10-13 11:02:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 69 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-13 11:02:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2024-10-13 11:02:48,693 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 38 [2024-10-13 11:02:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:48,694 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2024-10-13 11:02:48,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 11:02:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-10-13 11:02:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 11:02:48,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:48,696 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:48,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 11:02:48,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:48,901 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:48,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:48,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1901179498, now seen corresponding path program 1 times [2024-10-13 11:02:48,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:48,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859866439] [2024-10-13 11:02:48,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:48,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:49,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:49,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:49,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:02:49,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:49,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859866439] [2024-10-13 11:02:49,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859866439] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:49,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120692922] [2024-10-13 11:02:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:49,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:49,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:49,319 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-13 11:02:49,320 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-13 11:02:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:49,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-13 11:02:49,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:49,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 11:02:49,733 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-13 11:02:49,736 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-13 11:02:49,776 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) 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-13 11:02:49,817 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-13 11:02:49,817 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-13 11:02:49,822 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-13 11:02:49,874 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-13 11:02:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-10-13 11:02:49,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:50,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120692922] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:50,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:02:50,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-10-13 11:02:50,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128208872] [2024-10-13 11:02:50,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:50,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 11:02:50,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:50,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 11:02:50,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=497, Unknown=1, NotChecked=44, Total=600 [2024-10-13 11:02:50,081 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 22 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 11:02:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:50,824 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2024-10-13 11:02:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:02:50,824 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-10-13 11:02:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:50,825 INFO L225 Difference]: With dead ends: 102 [2024-10-13 11:02:50,825 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 11:02:50,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=1065, Unknown=1, NotChecked=66, Total=1260 [2024-10-13 11:02:50,826 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 86 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:50,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 793 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 765 Invalid, 0 Unknown, 108 Unchecked, 0.5s Time] [2024-10-13 11:02:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 11:02:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 76. [2024-10-13 11:02:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 70 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-13 11:02:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-10-13 11:02:50,830 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 38 [2024-10-13 11:02:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:50,830 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-10-13 11:02:50,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 11:02:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-10-13 11:02:50,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 11:02:50,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:50,831 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:50,847 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-13 11:02:51,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:51,035 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:51,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2048942810, now seen corresponding path program 1 times [2024-10-13 11:02:51,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:51,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363644597] [2024-10-13 11:02:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:51,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:51,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:51,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 11:02:51,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:51,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363644597] [2024-10-13 11:02:51,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363644597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:51,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:51,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 11:02:51,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128077659] [2024-10-13 11:02:51,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:51,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:02:51,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:51,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:02:51,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:51,276 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 10 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:51,504 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2024-10-13 11:02:51,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 11:02:51,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-13 11:02:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:51,505 INFO L225 Difference]: With dead ends: 113 [2024-10-13 11:02:51,505 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 11:02:51,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:02:51,506 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:51,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 299 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:02:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 11:02:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 79. [2024-10-13 11:02:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 73 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-13 11:02:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2024-10-13 11:02:51,511 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 38 [2024-10-13 11:02:51,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:51,512 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2024-10-13 11:02:51,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2024-10-13 11:02:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 11:02:51,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:51,512 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:51,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 11:02:51,513 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:51,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:51,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2048942811, now seen corresponding path program 1 times [2024-10-13 11:02:51,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:51,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434748721] [2024-10-13 11:02:51,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:51,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:51,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:51,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:02:51,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:51,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434748721] [2024-10-13 11:02:51,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434748721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:51,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027475291] [2024-10-13 11:02:51,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:51,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:51,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:51,798 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-13 11:02:51,800 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-13 11:02:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:52,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 11:02:52,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:52,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 11:02:52,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-13 11:02:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 11:02:52,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:52,206 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 26 [2024-10-13 11:02:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 11:02:52,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027475291] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:52,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:02:52,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 10] total 21 [2024-10-13 11:02:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613645495] [2024-10-13 11:02:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:52,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:02:52,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:52,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:02:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-10-13 11:02:52,369 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 10 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:52,507 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2024-10-13 11:02:52,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:02:52,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-13 11:02:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:52,509 INFO L225 Difference]: With dead ends: 90 [2024-10-13 11:02:52,509 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 11:02:52,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-10-13 11:02:52,510 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 23 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:52,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 289 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:52,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 11:02:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-10-13 11:02:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 72 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-13 11:02:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-10-13 11:02:52,513 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 38 [2024-10-13 11:02:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:52,513 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-10-13 11:02:52,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-10-13 11:02:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 11:02:52,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:52,514 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:52,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 11:02:52,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:52,719 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:52,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:52,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2048942858, now seen corresponding path program 1 times [2024-10-13 11:02:52,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:52,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706014690] [2024-10-13 11:02:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:52,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:52,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:52,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:52,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:02:52,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:52,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706014690] [2024-10-13 11:02:52,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706014690] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:52,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928948139] [2024-10-13 11:02:52,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:52,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:52,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:52,980 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-13 11:02:52,982 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-13 11:02:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:53,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 11:02:53,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:53,229 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-13 11:02:53,365 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-13 11:02:53,370 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-13 11:02:53,400 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-13 11:02:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 11:02:53,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:02:53,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928948139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:53,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:02:53,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2024-10-13 11:02:53,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898589299] [2024-10-13 11:02:53,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:53,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 11:02:53,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:53,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 11:02:53,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-10-13 11:02:53,421 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 9 states, 6 states have (on average 4.166666666666667) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:53,631 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-10-13 11:02:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 11:02:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.166666666666667) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-13 11:02:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:53,632 INFO L225 Difference]: With dead ends: 105 [2024-10-13 11:02:53,632 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 11:02:53,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2024-10-13 11:02:53,633 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:53,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 419 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:02:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 11:02:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 74. [2024-10-13 11:02:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 68 states have internal predecessors, (76), 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-13 11:02:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-10-13 11:02:53,636 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 38 [2024-10-13 11:02:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:53,636 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-10-13 11:02:53,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.166666666666667) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-10-13 11:02:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 11:02:53,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:53,637 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:53,655 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-13 11:02:53,841 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,SelfDestructingSolverStorable22 [2024-10-13 11:02:53,842 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:02:53,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:53,842 INFO L85 PathProgramCache]: Analyzing trace with hash 971628063, now seen corresponding path program 1 times [2024-10-13 11:02:53,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:53,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748162111] [2024-10-13 11:02:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:55,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:02:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:02:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:55,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:02:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 11:02:55,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:55,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748162111] [2024-10-13 11:02:55,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748162111] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:55,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977266677] [2024-10-13 11:02:55,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:55,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:55,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:55,537 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-13 11:02:55,540 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-13 11:02:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:55,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-13 11:02:55,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:55,796 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-13 11:02:55,934 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-13 11:02:55,934 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-13 11:02:56,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:02:56,156 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 42 treesize of output 14 [2024-10-13 11:02:56,161 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-13 11:02:56,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:56,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-10-13 11:02:56,475 INFO L349 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2024-10-13 11:02:56,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2024-10-13 11:02:56,781 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-10-13 11:02:56,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 60 [2024-10-13 11:02:56,966 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-13 11:02:56,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 98 [2024-10-13 11:02:57,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 11:02:57,167 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 164 treesize of output 116 [2024-10-13 11:02:57,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:57,180 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 129 treesize of output 105 [2024-10-13 11:02:57,357 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 93 treesize of output 51 [2024-10-13 11:02:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:57,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977266677] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:58,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:02:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 47 [2024-10-13 11:02:58,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355598326] [2024-10-13 11:02:58,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:58,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-13 11:02:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:58,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-13 11:02:58,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2776, Unknown=4, NotChecked=0, Total=2970 [2024-10-13 11:02:58,204 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 48 states, 40 states have (on average 1.65) internal successors, (66), 40 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 11:03:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:00,431 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2024-10-13 11:03:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-13 11:03:00,431 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 40 states have (on average 1.65) internal successors, (66), 40 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2024-10-13 11:03:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:00,432 INFO L225 Difference]: With dead ends: 124 [2024-10-13 11:03:00,432 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 11:03:00,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1428 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=452, Invalid=5706, Unknown=4, NotChecked=0, Total=6162 [2024-10-13 11:03:00,434 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 202 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:00,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 921 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 11:03:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 11:03:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 83. [2024-10-13 11:03:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.435483870967742) internal successors, (89), 77 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:03:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2024-10-13 11:03:00,437 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 42 [2024-10-13 11:03:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:00,438 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2024-10-13 11:03:00,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 40 states have (on average 1.65) internal successors, (66), 40 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 11:03:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2024-10-13 11:03:00,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 11:03:00,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:00,439 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:00,453 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-13 11:03:00,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-13 11:03:00,639 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-13 11:03:00,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:00,640 INFO L85 PathProgramCache]: Analyzing trace with hash 971628064, now seen corresponding path program 1 times [2024-10-13 11:03:00,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:00,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881931807] [2024-10-13 11:03:00,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:00,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:03:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 11:03:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:01,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:03:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 11:03:01,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:01,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881931807] [2024-10-13 11:03:01,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881931807] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:01,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093707967] [2024-10-13 11:03:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:01,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:01,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:01,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-13 11:03:01,757 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-13 11:03:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:02,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-10-13 11:03:02,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:02,032 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-13 11:03:02,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:03:02,316 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-13 11:03:02,316 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 12 treesize of output 18 [2024-10-13 11:03:02,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:03:02,400 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-13 11:03:02,509 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-13 11:03:02,514 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 3 [2024-10-13 11:03:02,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:02,523 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 19 [2024-10-13 11:03:02,528 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-13 11:03:02,899 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-13 11:03:02,899 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 26 treesize of output 29 [2024-10-13 11:03:02,908 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 11 treesize of output 3 [2024-10-13 11:03:02,921 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-13 11:03:02,921 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-13 11:03:02,933 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-13 11:03:02,954 INFO L349 Elim1Store]: treesize reduction 67, result has 35.6 percent of original size [2024-10-13 11:03:02,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 53 [2024-10-13 11:03:03,535 INFO L349 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2024-10-13 11:03:03,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 56 [2024-10-13 11:03:03,555 INFO L349 Elim1Store]: treesize reduction 59, result has 22.4 percent of original size [2024-10-13 11:03:03,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2024-10-13 11:03:03,793 INFO L349 Elim1Store]: treesize reduction 72, result has 41.5 percent of original size [2024-10-13 11:03:03,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 149 [2024-10-13 11:03:03,820 INFO L349 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2024-10-13 11:03:03,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 127 [2024-10-13 11:03:03,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 11:03:04,130 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 11 treesize of output 7 [2024-10-13 11:03:04,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:04,201 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 145 treesize of output 162