./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.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/dll2c_remove_all.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 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:59:10,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:59:10,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:59:10,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:59:10,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:59:10,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:59:10,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:59:10,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:59:10,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:59:10,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:59:10,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:59:10,185 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:59:10,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:59:10,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:59:10,187 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:59:10,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:59:10,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:59:10,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:59:10,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:59:10,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:59:10,189 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:59:10,193 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:59:10,193 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:59:10,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:59:10,193 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:59:10,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:59:10,194 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:59:10,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:59:10,194 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:59:10,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:59:10,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:59:10,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:59:10,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:59:10,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:59:10,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:59:10,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:59:10,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:59:10,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:59:10,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:59:10,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:59:10,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:59:10,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:59:10,200 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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2024-10-13 10:59:10,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:59:10,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:59:10,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:59:10,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:59:10,476 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:59:10,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2024-10-13 10:59:12,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:59:12,303 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:59:12,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2024-10-13 10:59:12,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f8f750d/31c0592d324240de9d2c2498d456781e/FLAGc8360f1ba [2024-10-13 10:59:12,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f8f750d/31c0592d324240de9d2c2498d456781e [2024-10-13 10:59:12,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:59:12,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:59:12,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:59:12,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:59:12,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:59:12,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257dea67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12, skipping insertion in model container [2024-10-13 10:59:12,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:59:12,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:59:12,790 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:59:12,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:59:12,867 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:59:12,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12 WrapperNode [2024-10-13 10:59:12,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:59:12,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:59:12,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:59:12,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:59:12,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,912 INFO L138 Inliner]: procedures = 126, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2024-10-13 10:59:12,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:59:12,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:59:12,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:59:12,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:59:12,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,946 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 9, 11]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 11 writes are split as follows [0, 2, 9]. [2024-10-13 10:59:12,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:59:12,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:59:12,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:59:12,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:59:12,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (1/1) ... [2024-10-13 10:59:12,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:59:12,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:13,043 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 10:59:13,046 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 10:59:13,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:59:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:59:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 10:59:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-13 10:59:13,096 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-13 10:59:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:59:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:59:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:59:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:59:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:59:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:59:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:59:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:59:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:59:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:59:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 10:59:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 10:59:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 10:59:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:59:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:59:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 10:59:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:59:13,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:59:13,217 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:59:13,219 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:59:13,547 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-10-13 10:59:13,547 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:59:13,589 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:59:13,589 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 10:59:13,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:13 BoogieIcfgContainer [2024-10-13 10:59:13,590 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:59:13,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:59:13,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:59:13,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:59:13,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:59:12" (1/3) ... [2024-10-13 10:59:13,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e65b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:13, skipping insertion in model container [2024-10-13 10:59:13,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:12" (2/3) ... [2024-10-13 10:59:13,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e65b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:13, skipping insertion in model container [2024-10-13 10:59:13,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:13" (3/3) ... [2024-10-13 10:59:13,599 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2024-10-13 10:59:13,617 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:59:13,617 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-10-13 10:59:13,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:59:13,682 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;@58308677, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:59:13,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-10-13 10:59:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 88 states have internal predecessors, (97), 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 10:59:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:59:13,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:13,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:59:13,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:13,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash 180097709, now seen corresponding path program 1 times [2024-10-13 10:59:13,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:13,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742087413] [2024-10-13 10:59:13,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:14,065 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 10:59:14,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:14,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742087413] [2024-10-13 10:59:14,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742087413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:14,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:14,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:59:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140624000] [2024-10-13 10:59:14,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:14,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:59:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:14,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:59:14,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:59:14,109 INFO L87 Difference]: Start difference. First operand has 92 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 88 states have internal predecessors, (97), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:59:14,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:14,247 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-10-13 10:59:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:59:14,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 10:59:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:14,259 INFO L225 Difference]: With dead ends: 88 [2024-10-13 10:59:14,260 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 10:59:14,262 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 10:59:14,267 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:14,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 10:59:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 10:59:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 40 states have (on average 2.15) internal successors, (86), 82 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 10:59:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-10-13 10:59:14,319 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 5 [2024-10-13 10:59:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:14,320 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-10-13 10:59:14,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:59:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-10-13 10:59:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:59:14,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:14,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:59:14,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:59:14,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:14,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:14,324 INFO L85 PathProgramCache]: Analyzing trace with hash 180097710, now seen corresponding path program 1 times [2024-10-13 10:59:14,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:14,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832571909] [2024-10-13 10:59:14,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:14,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:14,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 10:59:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832571909] [2024-10-13 10:59:14,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832571909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:14,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:14,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:59:14,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646339554] [2024-10-13 10:59:14,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:14,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:59:14,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:59:14,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:59:14,462 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:59:14,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:14,540 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-10-13 10:59:14,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:59:14,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 10:59:14,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:14,542 INFO L225 Difference]: With dead ends: 83 [2024-10-13 10:59:14,542 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 10:59:14,543 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 10:59:14,544 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:14,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 10:59:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 10:59:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 40 states have (on average 2.075) internal successors, (83), 79 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 10:59:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-10-13 10:59:14,556 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 5 [2024-10-13 10:59:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:14,556 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-10-13 10:59:14,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:59:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-10-13 10:59:14,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 10:59:14,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:14,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:14,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:59:14,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:14,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:14,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1003306652, now seen corresponding path program 1 times [2024-10-13 10:59:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:14,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915742281] [2024-10-13 10:59:14,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:14,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:14,680 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 10:59:14,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:14,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915742281] [2024-10-13 10:59:14,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915742281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:14,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:14,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:59:14,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846175648] [2024-10-13 10:59:14,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:14,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:59:14,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:14,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:59:14,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:59:14,688 INFO L87 Difference]: Start difference. First operand 83 states and 87 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 10:59:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:14,821 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-10-13 10:59:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:59:14,822 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 10:59:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:14,823 INFO L225 Difference]: With dead ends: 84 [2024-10-13 10:59:14,824 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 10:59:14,825 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 10:59:14,826 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:14,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 164 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 10:59:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 10:59:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 41 states have (on average 2.048780487804878) internal successors, (84), 80 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 10:59:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-10-13 10:59:14,840 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 11 [2024-10-13 10:59:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:14,841 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-10-13 10:59:14,841 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 10:59:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-10-13 10:59:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:59:14,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:14,842 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:14,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:59:14,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:14,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash -905761605, now seen corresponding path program 1 times [2024-10-13 10:59:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:14,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152578471] [2024-10-13 10:59:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:14,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:15,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:59:15,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:15,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152578471] [2024-10-13 10:59:15,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152578471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:15,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:15,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:59:15,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179980198] [2024-10-13 10:59:15,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:15,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:59:15,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:15,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:59:15,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:59:15,116 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:59:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:15,352 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-10-13 10:59:15,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:59:15,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-13 10:59:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:15,355 INFO L225 Difference]: With dead ends: 83 [2024-10-13 10:59:15,356 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 10:59:15,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:59:15,359 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 7 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:15,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 234 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:59:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 10:59:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 10:59:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 41 states have (on average 2.024390243902439) internal successors, (83), 79 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 10:59:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-10-13 10:59:15,369 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 19 [2024-10-13 10:59:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:15,373 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-10-13 10:59:15,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:59:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-10-13 10:59:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:59:15,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:15,374 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:15,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:59:15,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:15,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:15,375 INFO L85 PathProgramCache]: Analyzing trace with hash -905761604, now seen corresponding path program 1 times [2024-10-13 10:59:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:15,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923950254] [2024-10-13 10:59:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:15,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:15,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:15,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:15,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:15,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923950254] [2024-10-13 10:59:15,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923950254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:15,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:15,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:59:15,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153034798] [2024-10-13 10:59:15,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:15,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:59:15,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:15,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:59:15,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:59:15,685 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:59:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:15,886 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2024-10-13 10:59:15,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:59:15,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-13 10:59:15,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:15,887 INFO L225 Difference]: With dead ends: 82 [2024-10-13 10:59:15,889 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 10:59:15,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:59:15,890 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 6 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:15,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 258 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:59:15,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 10:59:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-13 10:59:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 41 states have (on average 2.0) internal successors, (82), 78 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 10:59:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-10-13 10:59:15,902 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 19 [2024-10-13 10:59:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:15,903 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-10-13 10:59:15,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:59:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-10-13 10:59:15,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:59:15,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:15,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:15,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:59:15,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:15,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1441458396, now seen corresponding path program 1 times [2024-10-13 10:59:15,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:15,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801323685] [2024-10-13 10:59:15,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:15,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:16,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:16,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:16,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:16,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801323685] [2024-10-13 10:59:16,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801323685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:16,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818403558] [2024-10-13 10:59:16,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:16,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:16,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:16,275 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 10:59:16,276 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 10:59:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:16,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 10:59:16,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:16,445 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 10:59:16,484 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 10:59:16,520 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:59:16,520 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 14 [2024-10-13 10:59:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-13 10:59:16,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:59:16,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818403558] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:59:16,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:59:16,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-10-13 10:59:16,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798592571] [2024-10-13 10:59:16,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:16,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:59:16,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:59:16,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-10-13 10:59:16,715 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:59:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:17,096 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2024-10-13 10:59:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:59:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2024-10-13 10:59:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:17,099 INFO L225 Difference]: With dead ends: 87 [2024-10-13 10:59:17,099 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 10:59:17,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-10-13 10:59:17,100 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:17,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 424 Invalid, 0 Unknown, 89 Unchecked, 0.3s Time] [2024-10-13 10:59:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 10:59:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 10:59:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 82 states have internal predecessors, (88), 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 10:59:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2024-10-13 10:59:17,112 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 21 [2024-10-13 10:59:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:17,113 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2024-10-13 10:59:17,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:59:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-10-13 10:59:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:59:17,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:17,114 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:17,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:59:17,314 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 10:59:17,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:17,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1441458397, now seen corresponding path program 1 times [2024-10-13 10:59:17,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:17,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610136161] [2024-10-13 10:59:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:17,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:17,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:17,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610136161] [2024-10-13 10:59:17,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610136161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:17,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991874468] [2024-10-13 10:59:17,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:17,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:17,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:17,684 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 10:59:17,685 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 10:59:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:17,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:59:17,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:17,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:59:17,827 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 10:59:17,972 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-13 10:59:18,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:18,026 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 10:59:18,035 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:59:18,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:59:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-13 10:59:18,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:18,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991874468] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:18,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:18,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-13 10:59:18,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475650384] [2024-10-13 10:59:18,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:18,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 10:59:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:18,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 10:59:18,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2024-10-13 10:59:18,189 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 16 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:59:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:18,629 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-10-13 10:59:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:59:18,630 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2024-10-13 10:59:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:18,631 INFO L225 Difference]: With dead ends: 87 [2024-10-13 10:59:18,631 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 10:59:18,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2024-10-13 10:59:18,632 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:18,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 494 Invalid, 0 Unknown, 88 Unchecked, 0.3s Time] [2024-10-13 10:59:18,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 10:59:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 10:59:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 82 states have internal predecessors, (87), 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 10:59:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-10-13 10:59:18,643 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 21 [2024-10-13 10:59:18,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:18,643 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-10-13 10:59:18,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:59:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-10-13 10:59:18,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:59:18,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:18,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:18,667 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 10:59:18,848 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 10:59:18,848 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:18,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:18,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2032763918, now seen corresponding path program 1 times [2024-10-13 10:59:18,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:18,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962579384] [2024-10-13 10:59:18,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:18,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:18,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:18,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:19,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:19,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962579384] [2024-10-13 10:59:19,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962579384] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:19,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774156945] [2024-10-13 10:59:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:19,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:19,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:19,012 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 10:59:19,015 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 10:59:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:19,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:59:19,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:19,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:19,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774156945] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:59:19,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:59:19,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-10-13 10:59:19,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541874585] [2024-10-13 10:59:19,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:19,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:59:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:19,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:59:19,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:59:19,203 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:59:19,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:19,347 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-10-13 10:59:19,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:59:19,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-13 10:59:19,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:19,348 INFO L225 Difference]: With dead ends: 87 [2024-10-13 10:59:19,348 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 10:59:19,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:59:19,349 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:19,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 364 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:19,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 10:59:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 10:59:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 82 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 10:59:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-10-13 10:59:19,361 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 23 [2024-10-13 10:59:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:19,361 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-10-13 10:59:19,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:59:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-10-13 10:59:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:59:19,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:19,362 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:19,383 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 10:59:19,563 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 10:59:19,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:19,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1404047319, now seen corresponding path program 1 times [2024-10-13 10:59:19,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:19,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120783228] [2024-10-13 10:59:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:19,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:19,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:19,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:59:19,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:19,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120783228] [2024-10-13 10:59:19,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120783228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:19,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730520368] [2024-10-13 10:59:19,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:19,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:19,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:19,672 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 10:59:19,673 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 10:59:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:19,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 10:59:19,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:19,817 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 10:59:19,883 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-13 10:59:19,927 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-13 10:59:19,928 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 10:59:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-10-13 10:59:19,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:19,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730520368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:19,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:19,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2024-10-13 10:59:19,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142523589] [2024-10-13 10:59:19,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:20,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:59:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:20,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:59:20,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2024-10-13 10:59:20,002 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:59:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:20,228 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-10-13 10:59:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:59:20,228 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-13 10:59:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:20,229 INFO L225 Difference]: With dead ends: 86 [2024-10-13 10:59:20,229 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 10:59:20,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2024-10-13 10:59:20,230 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:20,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 322 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 325 Invalid, 0 Unknown, 86 Unchecked, 0.2s Time] [2024-10-13 10:59:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 10:59:20,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 10:59:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 81 states have internal predecessors, (85), 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 10:59:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-10-13 10:59:20,238 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 24 [2024-10-13 10:59:20,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:20,238 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-10-13 10:59:20,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:59:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-10-13 10:59:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:59:20,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:20,239 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:20,258 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 10:59:20,439 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 10:59:20,440 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:20,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:20,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1404047320, now seen corresponding path program 1 times [2024-10-13 10:59:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:20,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028327867] [2024-10-13 10:59:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:20,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:20,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:20,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:20,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:20,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028327867] [2024-10-13 10:59:20,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028327867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:20,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268842749] [2024-10-13 10:59:20,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:20,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:20,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:20,712 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 10:59:20,713 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 10:59:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:20,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 10:59:20,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:20,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:59:20,862 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 10:59:20,984 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-13 10:59:21,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:21,019 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 10:59:21,028 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:59:21,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:59:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-13 10:59:21,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:21,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268842749] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:21,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:21,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-13 10:59:21,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695390646] [2024-10-13 10:59:21,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:21,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 10:59:21,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:21,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 10:59:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-10-13 10:59:21,184 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:59:21,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:21,590 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2024-10-13 10:59:21,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:59:21,591 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-13 10:59:21,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:21,593 INFO L225 Difference]: With dead ends: 103 [2024-10-13 10:59:21,593 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 10:59:21,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-10-13 10:59:21,594 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 16 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:21,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 458 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 531 Invalid, 0 Unknown, 108 Unchecked, 0.3s Time] [2024-10-13 10:59:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 10:59:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2024-10-13 10:59:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2024-10-13 10:59:21,605 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 24 [2024-10-13 10:59:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:21,605 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2024-10-13 10:59:21,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:59:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2024-10-13 10:59:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:59:21,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:21,606 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:21,627 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 10:59:21,811 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 10:59:21,812 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:21,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash 575793934, now seen corresponding path program 1 times [2024-10-13 10:59:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:21,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37167129] [2024-10-13 10:59:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:21,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:21,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:59:21,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:21,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37167129] [2024-10-13 10:59:21,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37167129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:21,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:21,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:59:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080416741] [2024-10-13 10:59:21,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:21,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:59:21,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:21,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:59:21,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:59:21,995 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:59:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:22,214 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2024-10-13 10:59:22,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:59:22,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-13 10:59:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:22,216 INFO L225 Difference]: With dead ends: 95 [2024-10-13 10:59:22,216 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 10:59:22,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:59:22,217 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 6 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:22,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 264 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:59:22,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 10:59:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-13 10:59:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 89 states have internal predecessors, (98), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-10-13 10:59:22,225 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 25 [2024-10-13 10:59:22,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:22,226 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-10-13 10:59:22,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:59:22,226 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-10-13 10:59:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:59:22,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:22,227 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:22,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:59:22,228 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:22,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash 575793935, now seen corresponding path program 1 times [2024-10-13 10:59:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:22,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933948023] [2024-10-13 10:59:22,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:22,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:22,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:22,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:22,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:22,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933948023] [2024-10-13 10:59:22,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933948023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:22,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:22,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:59:22,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646152743] [2024-10-13 10:59:22,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:22,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:59:22,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:22,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:59:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:59:22,516 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:59:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:22,719 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-10-13 10:59:22,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:59:22,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-13 10:59:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:22,720 INFO L225 Difference]: With dead ends: 94 [2024-10-13 10:59:22,720 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 10:59:22,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:59:22,721 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 5 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:22,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 289 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:59:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 10:59:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 10:59:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2024-10-13 10:59:22,725 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 25 [2024-10-13 10:59:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:22,725 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2024-10-13 10:59:22,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:59:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2024-10-13 10:59:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:59:22,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:22,726 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:22,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:59:22,727 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:22,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:22,727 INFO L85 PathProgramCache]: Analyzing trace with hash -712691798, now seen corresponding path program 1 times [2024-10-13 10:59:22,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:22,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632265662] [2024-10-13 10:59:22,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:22,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:22,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:23,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:59:23,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:23,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632265662] [2024-10-13 10:59:23,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632265662] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:23,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492742275] [2024-10-13 10:59:23,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:23,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:23,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:23,089 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 10:59:23,090 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 10:59:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:23,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:59:23,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:23,258 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 10:59:23,317 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-10-13 10:59:23,319 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-10-13 10:59:23,335 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)) is different from false [2024-10-13 10:59:23,337 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)) is different from true [2024-10-13 10:59:23,357 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 10:59:23,387 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:59:23,387 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 14 [2024-10-13 10:59:23,397 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|))))))) is different from false [2024-10-13 10:59:23,399 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|))))))) is different from true [2024-10-13 10:59:23,550 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|)))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1)))) is different from false [2024-10-13 10:59:23,553 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|)))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1)))) is different from true [2024-10-13 10:59:23,603 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|))))) is different from false [2024-10-13 10:59:23,605 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|))))) is different from true [2024-10-13 10:59:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-10-13 10:59:23,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:23,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492742275] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:59:23,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:59:23,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21 [2024-10-13 10:59:23,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433304385] [2024-10-13 10:59:23,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:23,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 10:59:23,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:23,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 10:59:23,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=208, Unknown=11, NotChecked=210, Total=506 [2024-10-13 10:59:23,952 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 23 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 10:59:24,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1))))))))) is different from false [2024-10-13 10:59:24,035 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1))))))))) is different from true [2024-10-13 10:59:24,038 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from false [2024-10-13 10:59:24,039 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from true [2024-10-13 10:59:24,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (and .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|))))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-10-13 10:59:24,046 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (and .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|))))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-10-13 10:59:24,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|)))) (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1)))))) is different from false [2024-10-13 10:59:24,052 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|)))) (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1)))))) is different from true [2024-10-13 10:59:24,058 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1))) (and (or (and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|))))) .cse0)) is different from false [2024-10-13 10:59:24,060 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1))) (and (or (and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|))))) .cse0)) is different from true [2024-10-13 10:59:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:24,454 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2024-10-13 10:59:24,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:59:24,454 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2024-10-13 10:59:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:24,456 INFO L225 Difference]: With dead ends: 136 [2024-10-13 10:59:24,456 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 10:59:24,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=292, Unknown=21, NotChecked=506, Total=930 [2024-10-13 10:59:24,457 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 111 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1071 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:24,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 364 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 568 Invalid, 0 Unknown, 1071 Unchecked, 0.4s Time] [2024-10-13 10:59:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 10:59:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 100. [2024-10-13 10:59:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.7619047619047619) internal successors, (111), 94 states have internal predecessors, (111), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2024-10-13 10:59:24,463 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 27 [2024-10-13 10:59:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:24,463 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2024-10-13 10:59:24,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 10:59:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2024-10-13 10:59:24,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:59:24,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:24,466 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:24,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 10:59:24,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:24,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:24,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash -712691797, now seen corresponding path program 1 times [2024-10-13 10:59:24,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:24,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671840179] [2024-10-13 10:59:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:24,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:25,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:25,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:25,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671840179] [2024-10-13 10:59:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671840179] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180980152] [2024-10-13 10:59:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:25,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:25,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:25,171 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 10:59:25,172 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 10:59:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:25,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 10:59:25,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:25,343 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 10:59:25,365 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 10:59:25,385 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 10:59:25,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:25,418 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 10:59:25,442 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 10:59:25,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:25,483 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 10:59:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:59:25,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:25,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180980152] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:25,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:25,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 14 [2024-10-13 10:59:25,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392132263] [2024-10-13 10:59:25,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:25,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 10:59:25,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:25,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 10:59:25,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2024-10-13 10:59:25,673 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:59:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:26,052 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2024-10-13 10:59:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:59:26,053 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-10-13 10:59:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:26,054 INFO L225 Difference]: With dead ends: 92 [2024-10-13 10:59:26,054 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 10:59:26,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=407, Unknown=1, NotChecked=42, Total=552 [2024-10-13 10:59:26,055 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 166 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:26,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 193 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 337 Invalid, 0 Unknown, 66 Unchecked, 0.3s Time] [2024-10-13 10:59:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 10:59:26,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-13 10:59:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.5714285714285714) internal successors, (99), 86 states have internal predecessors, (99), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2024-10-13 10:59:26,058 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 27 [2024-10-13 10:59:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:26,058 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2024-10-13 10:59:26,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:59:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2024-10-13 10:59:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:59:26,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:26,062 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:26,080 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 10:59:26,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:26,266 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:26,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash -712691802, now seen corresponding path program 1 times [2024-10-13 10:59:26,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:26,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879975381] [2024-10-13 10:59:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:26,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:26,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 10:59:26,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:26,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879975381] [2024-10-13 10:59:26,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879975381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:26,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:26,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:59:26,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68270313] [2024-10-13 10:59:26,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:26,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:59:26,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:26,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:59:26,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:59:26,377 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 10:59:26,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:26,458 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2024-10-13 10:59:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:59:26,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 27 [2024-10-13 10:59:26,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:26,459 INFO L225 Difference]: With dead ends: 125 [2024-10-13 10:59:26,460 INFO L226 Difference]: Without dead ends: 125 [2024-10-13 10:59:26,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:59:26,462 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 80 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:26,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 150 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-13 10:59:26,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2024-10-13 10:59:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 85 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-10-13 10:59:26,465 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 27 [2024-10-13 10:59:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:26,466 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-10-13 10:59:26,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 10:59:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-10-13 10:59:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:59:26,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:26,468 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:26,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:59:26,468 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:26,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash -618609235, now seen corresponding path program 1 times [2024-10-13 10:59:26,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:26,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454512697] [2024-10-13 10:59:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:26,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:26,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:26,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:59:26,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454512697] [2024-10-13 10:59:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454512697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:26,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:26,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:59:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595367633] [2024-10-13 10:59:26,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:26,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:59:26,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:26,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:59:26,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:59:26,708 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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 10:59:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:26,987 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2024-10-13 10:59:26,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:59:26,987 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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 28 [2024-10-13 10:59:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:26,988 INFO L225 Difference]: With dead ends: 119 [2024-10-13 10:59:26,988 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 10:59:26,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:59:26,989 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:26,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 266 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:59:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 10:59:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2024-10-13 10:59:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 86 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2024-10-13 10:59:26,994 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 28 [2024-10-13 10:59:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:26,994 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2024-10-13 10:59:26,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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 10:59:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2024-10-13 10:59:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:59:26,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:26,995 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:26,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:59:26,996 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:26,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:26,996 INFO L85 PathProgramCache]: Analyzing trace with hash -618609234, now seen corresponding path program 1 times [2024-10-13 10:59:26,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:26,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971928335] [2024-10-13 10:59:26,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:26,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:27,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:27,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:27,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971928335] [2024-10-13 10:59:27,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971928335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:27,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:27,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:59:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683780512] [2024-10-13 10:59:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:27,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:59:27,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:27,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:59:27,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:59:27,374 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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 10:59:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:27,657 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2024-10-13 10:59:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:59:27,657 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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 28 [2024-10-13 10:59:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:27,659 INFO L225 Difference]: With dead ends: 122 [2024-10-13 10:59:27,659 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 10:59:27,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:59:27,660 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:27,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 328 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:59:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 10:59:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 92. [2024-10-13 10:59:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.507936507936508) internal successors, (95), 86 states have internal predecessors, (95), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2024-10-13 10:59:27,666 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 28 [2024-10-13 10:59:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:27,666 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2024-10-13 10:59:27,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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 10:59:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2024-10-13 10:59:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:59:27,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:27,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:27,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:59:27,668 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:27,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1997013757, now seen corresponding path program 1 times [2024-10-13 10:59:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:27,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280901705] [2024-10-13 10:59:27,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:27,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:27,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:27,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 10:59:27,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:27,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280901705] [2024-10-13 10:59:27,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280901705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:27,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:27,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:59:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210202475] [2024-10-13 10:59:27,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:27,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:59:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:59:27,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:59:27,750 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 10:59:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:27,828 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2024-10-13 10:59:27,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:59:27,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 29 [2024-10-13 10:59:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:27,829 INFO L225 Difference]: With dead ends: 91 [2024-10-13 10:59:27,829 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 10:59:27,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 10:59:27,829 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:27,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 90 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 10:59:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-10-13 10:59:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.543859649122807) internal successors, (88), 79 states have internal predecessors, (88), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-10-13 10:59:27,834 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 29 [2024-10-13 10:59:27,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:27,834 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-10-13 10:59:27,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 10:59:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-10-13 10:59:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:59:27,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:27,835 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:27,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:59:27,835 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:27,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:27,836 INFO L85 PathProgramCache]: Analyzing trace with hash 850195118, now seen corresponding path program 1 times [2024-10-13 10:59:27,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:27,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066720116] [2024-10-13 10:59:27,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:27,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:27,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 10:59:27,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:27,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066720116] [2024-10-13 10:59:27,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066720116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:27,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:27,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:59:27,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817563848] [2024-10-13 10:59:27,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:27,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:59:27,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:27,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:59:27,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:59:27,942 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 10:59:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:28,063 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2024-10-13 10:59:28,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:59:28,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 10:59:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:28,064 INFO L225 Difference]: With dead ends: 84 [2024-10-13 10:59:28,064 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 10:59:28,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:59:28,065 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 22 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:28,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 155 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 10:59:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 10:59:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 78 states have internal predecessors, (87), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2024-10-13 10:59:28,068 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 32 [2024-10-13 10:59:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:28,069 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-10-13 10:59:28,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 10:59:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2024-10-13 10:59:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:59:28,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:28,071 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:28,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:59:28,071 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:28,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:28,072 INFO L85 PathProgramCache]: Analyzing trace with hash 850195119, now seen corresponding path program 1 times [2024-10-13 10:59:28,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:28,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242564629] [2024-10-13 10:59:28,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:28,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:28,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:28,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:28,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:28,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242564629] [2024-10-13 10:59:28,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242564629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:28,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:28,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 10:59:28,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358518066] [2024-10-13 10:59:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:28,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:59:28,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:28,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:59:28,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:59:28,523 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 10:59:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:28,826 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-10-13 10:59:28,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:59:28,826 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 32 [2024-10-13 10:59:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:28,827 INFO L225 Difference]: With dead ends: 112 [2024-10-13 10:59:28,827 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 10:59:28,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:59:28,828 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 58 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:28,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 353 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:59:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 10:59:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2024-10-13 10:59:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 82 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2024-10-13 10:59:28,831 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 32 [2024-10-13 10:59:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:28,832 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2024-10-13 10:59:28,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 10:59:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2024-10-13 10:59:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:59:28,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:28,833 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:28,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:59:28,833 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:28,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:28,834 INFO L85 PathProgramCache]: Analyzing trace with hash 850181215, now seen corresponding path program 1 times [2024-10-13 10:59:28,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:28,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723716636] [2024-10-13 10:59:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:28,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:28,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723716636] [2024-10-13 10:59:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723716636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:29,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:29,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:59:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324820662] [2024-10-13 10:59:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:29,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:59:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:59:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:59:29,058 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 10:59:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:29,313 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2024-10-13 10:59:29,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:59:29,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 32 [2024-10-13 10:59:29,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:29,315 INFO L225 Difference]: With dead ends: 124 [2024-10-13 10:59:29,315 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 10:59:29,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:59:29,316 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 69 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:29,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 379 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:59:29,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 10:59:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 99. [2024-10-13 10:59:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 93 states have internal predecessors, (111), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2024-10-13 10:59:29,320 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 32 [2024-10-13 10:59:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:29,320 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2024-10-13 10:59:29,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 10:59:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2024-10-13 10:59:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 10:59:29,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:29,321 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:29,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 10:59:29,322 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:29,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash 586247323, now seen corresponding path program 1 times [2024-10-13 10:59:29,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:29,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915837601] [2024-10-13 10:59:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:29,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915837601] [2024-10-13 10:59:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915837601] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305916094] [2024-10-13 10:59:30,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:30,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:30,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:30,042 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 10:59:30,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 10:59:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:30,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-13 10:59:30,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:30,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:59:30,683 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:59:30,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:59:30,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:59:30,818 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:59:30,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-10-13 10:59:30,918 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 10:59:30,918 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 24 treesize of output 17 [2024-10-13 10:59:30,971 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 57 treesize of output 36 [2024-10-13 10:59:31,077 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 56 treesize of output 32 [2024-10-13 10:59:31,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:59:31,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2024-10-13 10:59:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:59:31,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:31,155 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 36 treesize of output 28 [2024-10-13 10:59:31,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-13 10:59:31,194 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-10-13 10:59:31,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-10-13 10:59:31,226 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2415 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2415) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2024-10-13 10:59:31,233 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2415 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2415) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2024-10-13 10:59:31,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2415 (Array Int Int)) (v_ArrVal_2414 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2414) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2415) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2024-10-13 10:59:31,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:59:31,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-10-13 10:59:31,253 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 122 treesize of output 110 [2024-10-13 10:59:31,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-10-13 10:59:31,268 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 10:59:31,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305916094] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:31,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:31,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2024-10-13 10:59:31,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454336146] [2024-10-13 10:59:31,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:31,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-13 10:59:31,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:31,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-13 10:59:31,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1297, Unknown=3, NotChecked=222, Total=1640 [2024-10-13 10:59:31,401 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. Second operand has 34 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:32,224 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2024-10-13 10:59:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:59:32,224 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-10-13 10:59:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:32,226 INFO L225 Difference]: With dead ends: 116 [2024-10-13 10:59:32,226 INFO L226 Difference]: Without dead ends: 116 [2024-10-13 10:59:32,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=1742, Unknown=3, NotChecked=258, Total=2162 [2024-10-13 10:59:32,228 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 94 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:32,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 681 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:59:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-13 10:59:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2024-10-13 10:59:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 82 states have (on average 1.5) internal successors, (123), 103 states have internal predecessors, (123), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2024-10-13 10:59:32,234 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 33 [2024-10-13 10:59:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:32,234 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2024-10-13 10:59:32,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2024-10-13 10:59:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 10:59:32,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:32,235 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:32,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:59:32,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-13 10:59:32,440 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:32,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash 586247324, now seen corresponding path program 1 times [2024-10-13 10:59:32,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:32,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527978657] [2024-10-13 10:59:32,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:32,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:33,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:33,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:33,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:33,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527978657] [2024-10-13 10:59:33,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527978657] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:33,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461876429] [2024-10-13 10:59:33,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:33,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:33,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:33,462 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 10:59:33,463 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 10:59:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:33,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-13 10:59:33,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:33,770 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 10:59:33,776 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 10:59:34,020 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:59:34,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:59:34,028 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_10| |c_#length|))) (and (= (store |v_#length_BEFORE_CALL_10| .cse0 (select |c_#length| .cse0)) |c_#length|) (<= 12 (select |v_#length_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (< 11 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2024-10-13 10:59:34,030 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_10| |c_#length|))) (and (= (store |v_#length_BEFORE_CALL_10| .cse0 (select |c_#length| .cse0)) |c_#length|) (<= 12 (select |v_#length_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (< 11 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from true [2024-10-13 10:59:34,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:59:34,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:59:34,216 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:59:34,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-10-13 10:59:34,225 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 24 treesize of output 11 [2024-10-13 10:59:34,372 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 10:59:34,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-13 10:59:34,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:34,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 10:59:34,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-10-13 10:59:34,414 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 57 treesize of output 36 [2024-10-13 10:59:34,541 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 67 treesize of output 39 [2024-10-13 10:59:34,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-10-13 10:59:34,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:59:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:59:34,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:34,831 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 88 treesize of output 72 [2024-10-13 10:59:34,834 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 61 treesize of output 45 [2024-10-13 10:59:35,060 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2596 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2599) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2598 (Array Int Int)) (v_ArrVal_2597 (Array Int Int)) (v_ArrVal_2596 (Array Int Int))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2599) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2597) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2598) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2024-10-13 10:59:35,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:59:35,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2024-10-13 10:59:35,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:59:35,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-10-13 10:59:35,090 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 116 treesize of output 108 [2024-10-13 10:59:35,097 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 670 treesize of output 634 [2024-10-13 10:59:35,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2024-10-13 10:59:35,108 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 66 treesize of output 62 [2024-10-13 10:59:35,113 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 32 treesize of output 30 [2024-10-13 10:59:35,117 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 30 treesize of output 28 [2024-10-13 10:59:35,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:59:35,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-10-13 10:59:35,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:59:35,152 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:59:35,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-13 10:59:35,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461876429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:35,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:35,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2024-10-13 10:59:35,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142746076] [2024-10-13 10:59:35,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:35,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-13 10:59:35,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-13 10:59:35,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1632, Unknown=46, NotChecked=166, Total=1980 [2024-10-13 10:59:35,373 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand has 34 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 28 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:35,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 12 .cse0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_10| |c_#length|))) (and (= (store |v_#length_BEFORE_CALL_10| .cse1 (select |c_#length| .cse1)) |c_#length|) (<= 12 (select |v_#length_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (< 11 .cse0)))) is different from false [2024-10-13 10:59:35,618 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 12 .cse0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_10| |c_#length|))) (and (= (store |v_#length_BEFORE_CALL_10| .cse1 (select |c_#length| .cse1)) |c_#length|) (<= 12 (select |v_#length_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (< 11 .cse0)))) is different from true [2024-10-13 10:59:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:36,291 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2024-10-13 10:59:36,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:59:36,291 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 28 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-10-13 10:59:36,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:36,292 INFO L225 Difference]: With dead ends: 129 [2024-10-13 10:59:36,292 INFO L226 Difference]: Without dead ends: 129 [2024-10-13 10:59:36,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=214, Invalid=2297, Unknown=51, NotChecked=300, Total=2862 [2024-10-13 10:59:36,293 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 175 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:36,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 603 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 999 Invalid, 0 Unknown, 141 Unchecked, 0.6s Time] [2024-10-13 10:59:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-13 10:59:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2024-10-13 10:59:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 103 states have internal predecessors, (122), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2024-10-13 10:59:36,298 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 33 [2024-10-13 10:59:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:36,298 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2024-10-13 10:59:36,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 28 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2024-10-13 10:59:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 10:59:36,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:36,299 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:36,319 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 10:59:36,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:36,504 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:36,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:36,504 INFO L85 PathProgramCache]: Analyzing trace with hash 585813988, now seen corresponding path program 1 times [2024-10-13 10:59:36,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:36,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907659239] [2024-10-13 10:59:36,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:36,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:36,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:36,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907659239] [2024-10-13 10:59:36,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907659239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:36,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:36,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:59:36,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802835005] [2024-10-13 10:59:36,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:36,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:59:36,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:36,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:59:36,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:59:36,741 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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 10:59:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:36,981 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2024-10-13 10:59:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:59:36,982 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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 10:59:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:36,982 INFO L225 Difference]: With dead ends: 131 [2024-10-13 10:59:36,982 INFO L226 Difference]: Without dead ends: 131 [2024-10-13 10:59:36,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:59:36,983 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 58 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:36,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 331 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:59:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-13 10:59:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2024-10-13 10:59:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 106 states have internal predecessors, (125), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2024-10-13 10:59:36,986 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 33 [2024-10-13 10:59:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:36,987 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2024-10-13 10:59:36,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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 10:59:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2024-10-13 10:59:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:59:36,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:36,987 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:36,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 10:59:36,988 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:36,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash -27589745, now seen corresponding path program 1 times [2024-10-13 10:59:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416339656] [2024-10-13 10:59:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:37,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:37,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:37,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 10:59:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 10:59:37,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:37,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416339656] [2024-10-13 10:59:37,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416339656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:37,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:37,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:59:37,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855026136] [2024-10-13 10:59:37,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:37,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:59:37,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:37,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:59:37,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:59:37,092 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:59:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:37,157 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-10-13 10:59:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:59:37,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-10-13 10:59:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:37,158 INFO L225 Difference]: With dead ends: 85 [2024-10-13 10:59:37,158 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 10:59:37,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:59:37,159 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:37,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 10:59:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-13 10:59:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 81 states have internal predecessors, (92), 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 10:59:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-10-13 10:59:37,166 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 34 [2024-10-13 10:59:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:37,166 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-10-13 10:59:37,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:59:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-10-13 10:59:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:59:37,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:37,167 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:37,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 10:59:37,167 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:37,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash 993797886, now seen corresponding path program 1 times [2024-10-13 10:59:37,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:37,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456962155] [2024-10-13 10:59:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:37,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:37,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:37,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:37,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:37,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456962155] [2024-10-13 10:59:37,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456962155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:37,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:37,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 10:59:37,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922563115] [2024-10-13 10:59:37,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:37,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:59:37,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:37,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:59:37,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:59:37,545 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 10:59:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:37,834 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2024-10-13 10:59:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:59:37,835 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 34 [2024-10-13 10:59:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:37,835 INFO L225 Difference]: With dead ends: 89 [2024-10-13 10:59:37,835 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 10:59:37,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:59:37,836 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:37,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 348 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:59:37,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 10:59:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-10-13 10:59:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.46875) internal successors, (94), 82 states have internal predecessors, (94), 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 10:59:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-10-13 10:59:37,839 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 34 [2024-10-13 10:59:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:37,839 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-10-13 10:59:37,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 10:59:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-10-13 10:59:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:59:37,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:37,840 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:37,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 10:59:37,840 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:37,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:37,840 INFO L85 PathProgramCache]: Analyzing trace with hash 993797887, now seen corresponding path program 1 times [2024-10-13 10:59:37,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:37,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337717903] [2024-10-13 10:59:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:37,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:38,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:38,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:59:38,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:38,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337717903] [2024-10-13 10:59:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337717903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:38,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107323676] [2024-10-13 10:59:38,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:38,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:38,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:38,472 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 10:59:38,474 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 10:59:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:38,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-13 10:59:38,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:38,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:59:38,859 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 10:59:39,039 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 10:59:39,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:59:39,113 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:59:39,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:59:39,127 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 10:59:39,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-13 10:59:39,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-13 10:59:39,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-13 10:59:39,405 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 0 case distinctions, treesize of input 42 treesize of output 29 [2024-10-13 10:59:39,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-10-13 10:59:39,536 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 59 treesize of output 35 [2024-10-13 10:59:39,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:59:39,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 10:59:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:59:39,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:39,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:39,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:39,806 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 68 treesize of output 56 [2024-10-13 10:59:39,809 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 50 treesize of output 38 [2024-10-13 10:59:40,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107323676] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:40,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:40,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 32 [2024-10-13 10:59:40,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91537377] [2024-10-13 10:59:40,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:40,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 10:59:40,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 10:59:40,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2024-10-13 10:59:40,010 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 33 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:40,852 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2024-10-13 10:59:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 10:59:40,852 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2024-10-13 10:59:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:40,852 INFO L225 Difference]: With dead ends: 99 [2024-10-13 10:59:40,853 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 10:59:40,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=221, Invalid=2131, Unknown=0, NotChecked=0, Total=2352 [2024-10-13 10:59:40,853 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 93 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:40,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 601 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:59:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 10:59:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2024-10-13 10:59:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.453125) internal successors, (93), 82 states have internal predecessors, (93), 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 10:59:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2024-10-13 10:59:40,856 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 34 [2024-10-13 10:59:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:40,856 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2024-10-13 10:59:40,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2024-10-13 10:59:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:59:40,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:40,857 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:40,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 10:59:41,057 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,SelfDestructingSolverStorable26 [2024-10-13 10:59:41,058 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:41,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash 980364545, now seen corresponding path program 1 times [2024-10-13 10:59:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:41,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673706490] [2024-10-13 10:59:41,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:41,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:41,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:41,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 10:59:41,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:41,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673706490] [2024-10-13 10:59:41,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673706490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:41,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:41,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:59:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596950698] [2024-10-13 10:59:41,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:41,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:59:41,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:41,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:59:41,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:59:41,156 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (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 10:59:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:41,272 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2024-10-13 10:59:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:59:41,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (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 10:59:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:41,273 INFO L225 Difference]: With dead ends: 85 [2024-10-13 10:59:41,273 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 10:59:41,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:59:41,274 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:41,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 133 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 10:59:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-13 10:59:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.421875) internal successors, (91), 81 states have internal predecessors, (91), 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 10:59:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2024-10-13 10:59:41,277 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 34 [2024-10-13 10:59:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:41,277 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2024-10-13 10:59:41,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (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 10:59:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2024-10-13 10:59:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 10:59:41,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:41,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:41,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 10:59:41,278 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:41,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash 326529927, now seen corresponding path program 1 times [2024-10-13 10:59:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:41,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957424539] [2024-10-13 10:59:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:41,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:41,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:41,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:41,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957424539] [2024-10-13 10:59:41,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957424539] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:41,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300119518] [2024-10-13 10:59:41,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:41,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:41,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:41,568 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 10:59:41,569 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 10:59:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:41,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:59:41,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:41,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:41,916 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 10:59:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 10:59:41,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:59:41,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300119518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:41,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:59:41,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2024-10-13 10:59:41,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560125650] [2024-10-13 10:59:41,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:41,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:59:41,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:41,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:59:41,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:59:41,920 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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 10:59:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:42,044 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2024-10-13 10:59:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:59:42,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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 35 [2024-10-13 10:59:42,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:42,046 INFO L225 Difference]: With dead ends: 84 [2024-10-13 10:59:42,046 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 10:59:42,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:59:42,047 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 104 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:42,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 90 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:42,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 10:59:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 10:59:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.390625) internal successors, (89), 80 states have internal predecessors, (89), 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 10:59:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-10-13 10:59:42,052 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 35 [2024-10-13 10:59:42,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:42,053 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-10-13 10:59:42,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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 10:59:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-10-13 10:59:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 10:59:42,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:42,054 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:42,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 10:59:42,254 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,SelfDestructingSolverStorable28 [2024-10-13 10:59:42,254 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:42,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1557030656, now seen corresponding path program 1 times [2024-10-13 10:59:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:42,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004726717] [2024-10-13 10:59:42,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:42,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:42,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:42,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:42,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:42,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004726717] [2024-10-13 10:59:42,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004726717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:42,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:42,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:59:42,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229406817] [2024-10-13 10:59:42,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:42,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:59:42,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:42,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:59:42,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:59:42,481 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 10:59:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:42,635 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2024-10-13 10:59:42,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:59:42,635 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 36 [2024-10-13 10:59:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:42,635 INFO L225 Difference]: With dead ends: 106 [2024-10-13 10:59:42,636 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 10:59:42,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:59:42,636 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:42,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 328 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 10:59:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2024-10-13 10:59:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 86 states have internal predecessors, (100), 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 10:59:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2024-10-13 10:59:42,639 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 36 [2024-10-13 10:59:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:42,639 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2024-10-13 10:59:42,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 10:59:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2024-10-13 10:59:42,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 10:59:42,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:42,640 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:42,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 10:59:42,640 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:42,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1023310206, now seen corresponding path program 1 times [2024-10-13 10:59:42,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:42,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767416469] [2024-10-13 10:59:42,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:42,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:42,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:42,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767416469] [2024-10-13 10:59:42,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767416469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:42,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:42,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:59:42,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483278941] [2024-10-13 10:59:42,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:42,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:59:42,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:42,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:59:42,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:59:42,893 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 10:59:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:43,078 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2024-10-13 10:59:43,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:59:43,078 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 37 [2024-10-13 10:59:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:43,079 INFO L225 Difference]: With dead ends: 99 [2024-10-13 10:59:43,079 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 10:59:43,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:59:43,080 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:43,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 291 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:59:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 10:59:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-10-13 10:59:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 89 states have internal predecessors, (103), 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 10:59:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-10-13 10:59:43,083 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 37 [2024-10-13 10:59:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:43,083 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-10-13 10:59:43,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 10:59:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-10-13 10:59:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 10:59:43,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:43,084 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:43,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 10:59:43,084 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:43,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1657845442, now seen corresponding path program 1 times [2024-10-13 10:59:43,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:43,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464521875] [2024-10-13 10:59:43,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:43,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 10:59:43,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464521875] [2024-10-13 10:59:43,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464521875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:43,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:43,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:59:43,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72344310] [2024-10-13 10:59:43,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:43,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:59:43,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:43,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:59:43,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:59:43,217 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 10:59:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:43,323 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2024-10-13 10:59:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:59:43,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 38 [2024-10-13 10:59:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:43,324 INFO L225 Difference]: With dead ends: 92 [2024-10-13 10:59:43,324 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 10:59:43,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:59:43,325 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:43,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 132 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 10:59:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-13 10:59:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 88 states have internal predecessors, (102), 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 10:59:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2024-10-13 10:59:43,328 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 38 [2024-10-13 10:59:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:43,329 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2024-10-13 10:59:43,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 10:59:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2024-10-13 10:59:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 10:59:43,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:43,330 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:43,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-13 10:59:43,330 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:43,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:43,330 INFO L85 PathProgramCache]: Analyzing trace with hash -447798460, now seen corresponding path program 1 times [2024-10-13 10:59:43,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:43,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448127016] [2024-10-13 10:59:43,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:43,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 10:59:43,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:43,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448127016] [2024-10-13 10:59:43,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448127016] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:43,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804999310] [2024-10-13 10:59:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:43,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:43,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:43,453 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 10:59:43,454 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 10:59:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 10:59:43,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:43,752 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 10:59:43,765 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 10:59:43,810 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 10:59:43,811 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 10:59:43,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-13 10:59:43,869 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 10:59:43,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:43,899 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 10:59:43,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:43,997 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 10:59:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2024-10-13 10:59:44,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804999310] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:48,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:48,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2024-10-13 10:59:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16538789] [2024-10-13 10:59:48,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:48,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:59:48,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:48,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:59:48,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=222, Unknown=2, NotChecked=30, Total=306 [2024-10-13 10:59:48,269 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 14 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:59:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:48,501 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2024-10-13 10:59:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:59:48,501 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-10-13 10:59:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:48,502 INFO L225 Difference]: With dead ends: 106 [2024-10-13 10:59:48,502 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 10:59:48,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=94, Invalid=370, Unknown=2, NotChecked=40, Total=506 [2024-10-13 10:59:48,503 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 211 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:48,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 151 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 308 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2024-10-13 10:59:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 10:59:48,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2024-10-13 10:59:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.356164383561644) internal successors, (99), 86 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 10:59:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2024-10-13 10:59:48,506 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 38 [2024-10-13 10:59:48,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:48,507 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2024-10-13 10:59:48,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:59:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2024-10-13 10:59:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 10:59:48,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:48,508 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:48,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 10:59:48,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-13 10:59:48,708 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:48,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:48,709 INFO L85 PathProgramCache]: Analyzing trace with hash -146398719, now seen corresponding path program 1 times [2024-10-13 10:59:48,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:48,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914747081] [2024-10-13 10:59:48,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:48,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:48,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:49,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914747081] [2024-10-13 10:59:49,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914747081] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677564769] [2024-10-13 10:59:49,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:49,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:49,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:49,032 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:49,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-13 10:59:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:49,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:59:49,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:49,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:49,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:59:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 10:59:49,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:59:49,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677564769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:49,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:59:49,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2024-10-13 10:59:49,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128205532] [2024-10-13 10:59:49,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:49,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:59:49,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:49,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:59:49,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:59:49,418 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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 10:59:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:49,552 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2024-10-13 10:59:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:59:49,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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 39 [2024-10-13 10:59:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:49,553 INFO L225 Difference]: With dead ends: 89 [2024-10-13 10:59:49,553 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 10:59:49,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:59:49,553 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:49,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 100 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 10:59:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 10:59:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 85 states have internal predecessors, (98), 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 10:59:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2024-10-13 10:59:49,556 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 39 [2024-10-13 10:59:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:49,556 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2024-10-13 10:59:49,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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 10:59:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2024-10-13 10:59:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 10:59:49,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:49,557 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2024-10-13 10:59:49,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-13 10:59:49,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-13 10:59:49,758 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:49,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash -996850349, now seen corresponding path program 1 times [2024-10-13 10:59:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:49,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772641954] [2024-10-13 10:59:49,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:49,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:50,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:50,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:50,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:50,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772641954] [2024-10-13 10:59:50,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772641954] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:50,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415924258] [2024-10-13 10:59:50,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:50,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:50,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:50,669 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:50,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-13 10:59:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:50,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-13 10:59:50,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:50,967 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 10:59:51,083 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:59:51,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:59:51,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 11 treesize of output 7 [2024-10-13 10:59:51,179 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:59:51,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-10-13 10:59:51,245 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 10:59:51,245 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 24 treesize of output 17 [2024-10-13 10:59:51,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:51,253 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 46 treesize of output 33 [2024-10-13 10:59:51,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:51,422 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-10-13 10:59:51,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 41 [2024-10-13 10:59:51,521 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 10:59:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:59:51,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:51,657 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 8 treesize of output 4 [2024-10-13 10:59:51,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-10-13 10:59:51,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:59:51,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-10-13 10:59:51,897 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 85 treesize of output 81 [2024-10-13 10:59:51,901 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 100 treesize of output 96 [2024-10-13 10:59:51,905 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 87 treesize of output 85 [2024-10-13 10:59:51,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:59:51,914 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 92 treesize of output 96 [2024-10-13 10:59:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:59:52,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415924258] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:59:52,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:59:52,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 22] total 51 [2024-10-13 10:59:52,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005261940] [2024-10-13 10:59:52,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:52,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-13 10:59:52,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:52,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-13 10:59:52,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2349, Unknown=38, NotChecked=0, Total=2550 [2024-10-13 10:59:52,438 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 51 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 44 states have internal predecessors, (83), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 10:59:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:53,449 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2024-10-13 10:59:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:59:53,449 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 44 states have internal predecessors, (83), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2024-10-13 10:59:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:53,450 INFO L225 Difference]: With dead ends: 73 [2024-10-13 10:59:53,450 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 10:59:53,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=259, Invalid=3243, Unknown=38, NotChecked=0, Total=3540 [2024-10-13 10:59:53,451 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:53,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 936 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:59:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 10:59:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-10-13 10:59:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 65 states have internal predecessors, (67), 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 10:59:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2024-10-13 10:59:53,453 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 39 [2024-10-13 10:59:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:53,453 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2024-10-13 10:59:53,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 44 states have internal predecessors, (83), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 10:59:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2024-10-13 10:59:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 10:59:53,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:53,454 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:53,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-13 10:59:53,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:53,655 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:53,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash -956377077, now seen corresponding path program 1 times [2024-10-13 10:59:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:53,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000871789] [2024-10-13 10:59:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:53,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:54,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:59:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:54,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:59:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:55,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:55,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000871789] [2024-10-13 10:59:55,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000871789] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:55,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340130891] [2024-10-13 10:59:55,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:55,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:55,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:55,024 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:55,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-13 10:59:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:55,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-10-13 10:59:55,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:55,347 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 10:59:55,499 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:59:55,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:59:55,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:59:55,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 10:59:55,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 10:59:55,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:55,797 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 59 treesize of output 38 [2024-10-13 10:59:56,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:56,078 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-10-13 10:59:56,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 46 [2024-10-13 10:59:56,351 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 45 treesize of output 37 [2024-10-13 10:59:56,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:56,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 9 [2024-10-13 10:59:56,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-10-13 10:59:56,634 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 10:59:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:59:56,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:56,960 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 8 treesize of output 4 [2024-10-13 10:59:57,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-10-13 10:59:57,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:59:57,189 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 60 treesize of output 64 [2024-10-13 10:59:57,547 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_43| Int) (v_ArrVal_4602 (Array Int Int))) (or (forall ((v_ArrVal_4603 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4602) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4603) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_43| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_43| Int) (v_ArrVal_4602 (Array Int Int))) (or (forall ((v_ArrVal_4603 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4602) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4603) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_43| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-10-13 10:59:57,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:59:57,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-10-13 10:59:57,579 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 80 treesize of output 76 [2024-10-13 10:59:57,584 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 86 treesize of output 82 [2024-10-13 10:59:57,591 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 41 treesize of output 39 [2024-10-13 10:59:57,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:59:57,604 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 49 treesize of output 53 [2024-10-13 10:59:57,687 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 10:59:57,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2024-10-13 10:59:57,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340130891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:57,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:57,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 49 [2024-10-13 10:59:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443819619] [2024-10-13 10:59:57,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:57,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:59:57,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:57,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:59:57,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3691, Unknown=2, NotChecked=122, Total=4032 [2024-10-13 10:59:57,894 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 50 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:59,527 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2024-10-13 10:59:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-13 10:59:59,527 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2024-10-13 10:59:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:59,528 INFO L225 Difference]: With dead ends: 100 [2024-10-13 10:59:59,528 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 10:59:59,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=448, Invalid=6360, Unknown=2, NotChecked=162, Total=6972 [2024-10-13 10:59:59,530 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 134 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:59,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 605 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:59:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 10:59:59,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 75. [2024-10-13 10:59:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.271186440677966) internal successors, (75), 71 states have internal predecessors, (75), 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 10:59:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-10-13 10:59:59,533 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 43 [2024-10-13 10:59:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:59,533 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-10-13 10:59:59,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:59:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-10-13 10:59:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 10:59:59,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:59,534 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:59,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-13 10:59:59,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:59,735 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 10:59:59,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:59,736 INFO L85 PathProgramCache]: Analyzing trace with hash -956377076, now seen corresponding path program 1 times [2024-10-13 10:59:59,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:59,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933911395] [2024-10-13 10:59:59,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:59,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:00,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:00:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:00,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 11:00:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:00:00,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933911395] [2024-10-13 11:00:00,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933911395] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363359468] [2024-10-13 11:00:00,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:00,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:00,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:00,955 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:00:00,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-13 11:00:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:01,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-10-13 11:00:01,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:01,262 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:00:01,265 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:00:01,525 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 11:00:01,525 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:00:01,538 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:01,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:00:01,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:00:01,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:00:01,693 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:00:01,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-10-13 11:00:01,699 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 24 treesize of output 11 [2024-10-13 11:00:01,816 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 11:00:01,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-13 11:00:01,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:01,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:01,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:01,846 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 43 treesize of output 15 [2024-10-13 11:00:01,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:01,854 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 59 treesize of output 38 [2024-10-13 11:00:02,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:02,121 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-10-13 11:00:02,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 46 [2024-10-13 11:00:02,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:02,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:02,140 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 27 treesize of output 19 [2024-10-13 11:00:02,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 11:00:02,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-10-13 11:00:02,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 11:00:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:02,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:03,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:03,236 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 130 treesize of output 129 [2024-10-13 11:00:03,363 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 74 treesize of output 58 [2024-10-13 11:00:03,468 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_4826 (Array Int Int)) (v_ArrVal_4829 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4826) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_4829) 0))) (forall ((v_prenex_6 Int) (v_ArrVal_4826 (Array Int Int)) (v_ArrVal_4827 (Array Int Int))) (<= (+ (select (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4826) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_prenex_6) 0) 4) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4827) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2024-10-13 11:00:03,494 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_prenex_6 Int) (v_ArrVal_4826 (Array Int Int)) (v_ArrVal_4827 (Array Int Int))) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4826) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 v_prenex_6) 0) 4) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4827) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_4826 (Array Int Int)) (v_ArrVal_4829 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4826) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_45| 4) v_ArrVal_4829) 0)))))) is different from false [2024-10-13 11:00:03,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:03,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-10-13 11:00:03,788 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 178 treesize of output 172 [2024-10-13 11:00:03,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:03,803 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 54 treesize of output 58 [2024-10-13 11:00:03,817 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 57 treesize of output 55 [2024-10-13 11:00:03,826 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 58 treesize of output 54 [2024-10-13 11:00:03,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:03,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2024-10-13 11:00:03,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:03,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:03,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-10-13 11:00:03,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:03,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-10-13 11:00:03,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:03,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:03,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-13 11:00:03,944 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:03,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-10-13 11:00:03,948 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:03,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-13 11:00:04,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363359468] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:04,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:00:04,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2024-10-13 11:00:04,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69261003] [2024-10-13 11:00:04,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:04,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-13 11:00:04,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:04,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-13 11:00:04,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3209, Unknown=39, NotChecked=230, Total=3660 [2024-10-13 11:00:04,194 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 45 states, 40 states have (on average 1.85) internal successors, (74), 39 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 11:00:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:05,745 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2024-10-13 11:00:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 11:00:05,746 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 1.85) internal successors, (74), 39 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2024-10-13 11:00:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:05,746 INFO L225 Difference]: With dead ends: 101 [2024-10-13 11:00:05,746 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 11:00:05,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=307, Invalid=5062, Unknown=41, NotChecked=290, Total=5700 [2024-10-13 11:00:05,748 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 82 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:05,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 772 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 11:00:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 11:00:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2024-10-13 11:00:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 71 states have internal predecessors, (74), 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:00:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-10-13 11:00:05,751 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 43 [2024-10-13 11:00:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:05,751 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-10-13 11:00:05,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 1.85) internal successors, (74), 39 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 11:00:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-10-13 11:00:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 11:00:05,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:05,752 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:05,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-13 11:00:05,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-10-13 11:00:05,953 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 11:00:05,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash 417079860, now seen corresponding path program 1 times [2024-10-13 11:00:05,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:05,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426484953] [2024-10-13 11:00:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:05,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:06,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:00:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:06,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 11:00:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:00:06,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:06,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426484953] [2024-10-13 11:00:06,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426484953] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:06,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346146586] [2024-10-13 11:00:06,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:06,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:06,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:06,086 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:00:06,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-13 11:00:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:06,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:00:06,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:00:06,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:00:06,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346146586] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:06,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:06,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-13 11:00:06,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598412713] [2024-10-13 11:00:06,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:06,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 11:00:06,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:06,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 11:00:06,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:00:06,501 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:00:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:06,577 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2024-10-13 11:00:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:00:06,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-10-13 11:00:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:06,578 INFO L225 Difference]: With dead ends: 101 [2024-10-13 11:00:06,578 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 11:00:06,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:00:06,579 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 121 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:06,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 180 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:00:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 11:00:06,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2024-10-13 11:00:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 71 states have internal predecessors, (73), 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:00:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2024-10-13 11:00:06,581 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 44 [2024-10-13 11:00:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:06,581 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2024-10-13 11:00:06,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:00:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2024-10-13 11:00:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 11:00:06,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:06,582 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:06,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-13 11:00:06,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-13 11:00:06,783 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 11:00:06,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:06,783 INFO L85 PathProgramCache]: Analyzing trace with hash 39757325, now seen corresponding path program 1 times [2024-10-13 11:00:06,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:06,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717416984] [2024-10-13 11:00:06,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:06,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:07,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:00:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:07,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 11:00:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:00:07,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:07,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717416984] [2024-10-13 11:00:07,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717416984] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:07,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898744502] [2024-10-13 11:00:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:07,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:07,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:07,099 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:00:07,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-13 11:00:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:07,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-10-13 11:00:07,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:07,452 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:00:07,632 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:07,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:00:07,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:00:07,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:00:07,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:07,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:07,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:07,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:07,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:07,881 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 59 treesize of output 38 [2024-10-13 11:00:07,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:07,885 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 43 treesize of output 15 [2024-10-13 11:00:08,063 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-10-13 11:00:08,063 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 27 treesize of output 19 [2024-10-13 11:00:08,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:08,088 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-10-13 11:00:08,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 46 [2024-10-13 11:00:08,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-10-13 11:00:08,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-13 11:00:08,583 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:00:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:08,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:09,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:09,044 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 111 treesize of output 110 [2024-10-13 11:00:09,132 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 73 treesize of output 57 [2024-10-13 11:00:09,197 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5270 Int) (v_ArrVal_5267 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5266) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_5270) 0))) (or (< (+ 7 .cse0) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5267) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (< .cse0 0))))) is different from false [2024-10-13 11:00:09,224 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5270 Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| Int) (v_ArrVal_5267 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| 4))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5266) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_5270) 0))) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< (+ 7 .cse0) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5267) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (< .cse0 0))))) is different from false [2024-10-13 11:00:09,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:09,244 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 45 treesize of output 49 [2024-10-13 11:00:09,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:09,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 47 [2024-10-13 11:00:09,651 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 331 treesize of output 321 [2024-10-13 11:00:09,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:09,665 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 107 treesize of output 109 [2024-10-13 11:00:09,676 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 123 treesize of output 119 [2024-10-13 11:00:09,687 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 125 treesize of output 117 [2024-10-13 11:00:09,824 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-13 11:00:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-13 11:00:10,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898744502] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:10,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:10,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25, 25] total 57 [2024-10-13 11:00:10,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850635539] [2024-10-13 11:00:10,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:10,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-10-13 11:00:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:10,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-10-13 11:00:10,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2859, Unknown=27, NotChecked=218, Total=3306 [2024-10-13 11:00:10,356 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 58 states, 52 states have (on average 2.3653846153846154) internal successors, (123), 51 states have internal predecessors, (123), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 11:00:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:12,694 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2024-10-13 11:00:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-13 11:00:12,694 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 52 states have (on average 2.3653846153846154) internal successors, (123), 51 states have internal predecessors, (123), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2024-10-13 11:00:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:12,695 INFO L225 Difference]: With dead ends: 130 [2024-10-13 11:00:12,695 INFO L226 Difference]: Without dead ends: 130 [2024-10-13 11:00:12,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=608, Invalid=6014, Unknown=28, NotChecked=322, Total=6972 [2024-10-13 11:00:12,697 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 427 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:12,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 859 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1545 Invalid, 0 Unknown, 253 Unchecked, 1.1s Time] [2024-10-13 11:00:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-13 11:00:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 83. [2024-10-13 11:00:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 79 states have internal predecessors, (85), 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:00:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-10-13 11:00:12,701 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 47 [2024-10-13 11:00:12,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:12,701 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-10-13 11:00:12,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 52 states have (on average 2.3653846153846154) internal successors, (123), 51 states have internal predecessors, (123), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 11:00:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-10-13 11:00:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 11:00:12,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:12,702 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:12,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-13 11:00:12,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-13 11:00:12,903 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 11:00:12,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:12,903 INFO L85 PathProgramCache]: Analyzing trace with hash 39743421, now seen corresponding path program 1 times [2024-10-13 11:00:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:12,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598917464] [2024-10-13 11:00:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:13,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:00:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:13,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 11:00:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:00:13,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:13,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598917464] [2024-10-13 11:00:13,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598917464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:13,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387521317] [2024-10-13 11:00:13,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:13,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:13,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:13,755 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:00:13,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-13 11:00:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:14,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-10-13 11:00:14,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:14,092 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:00:14,245 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:14,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:00:14,312 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:00:14,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:14,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:14,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:14,448 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 43 treesize of output 15 [2024-10-13 11:00:14,564 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-10-13 11:00:14,564 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 27 treesize of output 19 [2024-10-13 11:00:14,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-13 11:00:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:14,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:15,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:15,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2024-10-13 11:00:15,202 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 22 [2024-10-13 11:00:15,269 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5493 Int) (v_ArrVal_5489 (Array Int Int))) (< (select (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5489) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5493) 0) 1)) is different from false [2024-10-13 11:00:15,280 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5493 Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_53| Int) (v_ArrVal_5489 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5489) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_53| 4) v_ArrVal_5493) 0) 1) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_53| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2024-10-13 11:00:15,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:15,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-10-13 11:00:15,398 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 162 treesize of output 156 [2024-10-13 11:00:15,403 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 47 treesize of output 45 [2024-10-13 11:00:15,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:15,413 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 64 treesize of output 68 [2024-10-13 11:00:15,419 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 58 treesize of output 54 [2024-10-13 11:00:15,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387521317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:15,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:00:15,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 43 [2024-10-13 11:00:15,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24540549] [2024-10-13 11:00:15,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:15,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-13 11:00:15,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:15,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-13 11:00:15,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2672, Unknown=27, NotChecked=210, Total=3080 [2024-10-13 11:00:15,666 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 44 states, 40 states have (on average 1.925) internal successors, (77), 38 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 11:00:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:16,563 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2024-10-13 11:00:16,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 11:00:16,564 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.925) internal successors, (77), 38 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-10-13 11:00:16,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:16,564 INFO L225 Difference]: With dead ends: 118 [2024-10-13 11:00:16,564 INFO L226 Difference]: Without dead ends: 118 [2024-10-13 11:00:16,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=272, Invalid=3998, Unknown=28, NotChecked=258, Total=4556 [2024-10-13 11:00:16,565 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 99 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:16,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 714 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:00:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-13 11:00:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2024-10-13 11:00:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.3) internal successors, (104), 92 states have internal predecessors, (104), 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:00:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2024-10-13 11:00:16,568 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 47 [2024-10-13 11:00:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:16,568 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2024-10-13 11:00:16,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.925) internal successors, (77), 38 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 11:00:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2024-10-13 11:00:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 11:00:16,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:16,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:16,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-13 11:00:16,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-13 11:00:16,769 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 11:00:16,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1232479485, now seen corresponding path program 1 times [2024-10-13 11:00:16,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:16,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276706979] [2024-10-13 11:00:16,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:16,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:00:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 11:00:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:00:18,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:18,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276706979] [2024-10-13 11:00:18,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276706979] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:18,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982296960] [2024-10-13 11:00:18,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:18,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:18,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:18,076 INFO L229 MonitoredProcess]: Starting monitored process 21 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:00:18,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-13 11:00:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:18,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 131 conjuncts are in the unsatisfiable core [2024-10-13 11:00:18,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:18,420 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:00:18,590 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:18,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:00:18,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:00:18,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:00:18,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:18,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:18,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:18,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:18,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-10-13 11:00:18,853 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 44 treesize of output 31 [2024-10-13 11:00:19,226 INFO L349 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2024-10-13 11:00:19,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 68 [2024-10-13 11:00:19,251 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:19,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:19,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 63 [2024-10-13 11:00:19,415 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:00:19,419 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:00:19,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 11:00:19,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-10-13 11:00:20,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-13 11:00:20,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-13 11:00:20,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 11:00:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:20,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:20,680 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 124 treesize of output 96 [2024-10-13 11:00:20,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:20,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:21,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:21,084 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 157 treesize of output 156 [2024-10-13 11:00:21,126 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 88 treesize of output 68 [2024-10-13 11:00:21,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:21,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2024-10-13 11:00:21,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 212 [2024-10-13 11:00:21,484 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 82 treesize of output 74 [2024-10-13 11:00:21,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:21,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 111 [2024-10-13 11:00:21,571 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 110 treesize of output 94 [2024-10-13 11:00:21,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:21,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-10-13 11:00:21,600 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:21,601 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:21,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-13 11:00:21,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982296960] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:21,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:00:21,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 51 [2024-10-13 11:00:21,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336964879] [2024-10-13 11:00:21,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:21,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-13 11:00:21,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:21,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-13 11:00:21,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=4599, Unknown=2, NotChecked=0, Total=4830 [2024-10-13 11:00:21,826 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 51 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 45 states have internal predecessors, (83), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 11:00:23,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:23,271 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2024-10-13 11:00:23,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-13 11:00:23,272 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 45 states have internal predecessors, (83), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2024-10-13 11:00:23,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:23,272 INFO L225 Difference]: With dead ends: 102 [2024-10-13 11:00:23,272 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 11:00:23,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1460 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=370, Invalid=6434, Unknown=2, NotChecked=0, Total=6806 [2024-10-13 11:00:23,273 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:23,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 779 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:00:23,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 11:00:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2024-10-13 11:00:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.2875) internal successors, (103), 92 states have internal predecessors, (103), 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:00:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2024-10-13 11:00:23,277 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 48 [2024-10-13 11:00:23,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:23,277 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2024-10-13 11:00:23,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 45 states have internal predecessors, (83), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 11:00:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2024-10-13 11:00:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 11:00:23,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:23,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:23,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-13 11:00:23,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-10-13 11:00:23,479 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-13 11:00:23,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:23,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1232046150, now seen corresponding path program 1 times [2024-10-13 11:00:23,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:23,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055557693] [2024-10-13 11:00:23,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:23,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:24,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:00:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:24,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 11:00:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:00:24,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:24,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055557693] [2024-10-13 11:00:24,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055557693] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:24,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150302363] [2024-10-13 11:00:24,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:24,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:24,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:24,540 INFO L229 MonitoredProcess]: Starting monitored process 22 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:00:24,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-13 11:00:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:24,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-10-13 11:00:24,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:24,906 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:00:24,955 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:00:24,997 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:24,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:00:25,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:00:25,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:25,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:00:25,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:25,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 38