./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_equal.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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:01:46,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:01:46,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:01:46,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:01:46,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:01:46,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:01:46,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:01:46,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:01:46,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:01:46,236 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:01:46,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:01:46,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:01:46,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:01:46,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:01:46,240 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:01:46,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:01:46,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:01:46,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:01:46,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:01:46,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:01:46,242 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:01:46,246 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:01:46,246 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:01:46,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:01:46,247 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:01:46,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:01:46,247 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:01:46,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:01:46,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:01:46,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:01:46,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:01:46,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:01:46,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:01:46,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:01:46,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:01:46,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:01:46,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:01:46,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:01:46,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:01:46,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:01:46,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:01:46,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:01:46,252 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2024-11-09 08:01:46,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:01:46,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:01:46,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:01:46,558 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:01:46,558 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:01:46,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2024-11-09 08:01:48,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:01:48,365 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:01:48,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2024-11-09 08:01:48,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484123f5a/a0fa8ae64e524ba5882f452f08f7f2ce/FLAGe7441b961 [2024-11-09 08:01:48,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484123f5a/a0fa8ae64e524ba5882f452f08f7f2ce [2024-11-09 08:01:48,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:01:48,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:01:48,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:01:48,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:01:48,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:01:48,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:48,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c107197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48, skipping insertion in model container [2024-11-09 08:01:48,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:48,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:01:48,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:01:48,826 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:01:48,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:01:48,917 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:01:48,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48 WrapperNode [2024-11-09 08:01:48,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:01:48,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:01:48,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:01:48,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:01:48,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:48,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:48,975 INFO L138 Inliner]: procedures = 127, calls = 54, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 164 [2024-11-09 08:01:48,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:01:48,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:01:48,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:01:48,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:01:48,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:48,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:48,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:49,012 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 22, 11]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2024-11-09 08:01:49,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:49,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:49,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:49,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:49,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:49,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:49,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:01:49,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:01:49,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:01:49,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:01:49,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (1/1) ... [2024-11-09 08:01:49,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:01:49,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:01:49,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 08:01:49,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 08:01:49,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 08:01:49,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 08:01:49,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 08:01:49,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 08:01:49,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 08:01:49,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 08:01:49,180 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 08:01:49,180 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 08:01:49,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:01:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:01:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 08:01:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:01:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:01:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 08:01:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:01:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:01:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 08:01:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:01:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 08:01:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 08:01:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 08:01:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:01:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:01:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 08:01:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:01:49,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:01:49,315 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:01:49,317 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:01:49,783 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-09 08:01:49,783 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:01:49,801 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:01:49,802 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 08:01:49,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:01:49 BoogieIcfgContainer [2024-11-09 08:01:49,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:01:49,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:01:49,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:01:49,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:01:49,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:01:48" (1/3) ... [2024-11-09 08:01:49,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195c44ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:01:49, skipping insertion in model container [2024-11-09 08:01:49,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:48" (2/3) ... [2024-11-09 08:01:49,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195c44ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:01:49, skipping insertion in model container [2024-11-09 08:01:49,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:01:49" (3/3) ... [2024-11-09 08:01:49,814 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2024-11-09 08:01:49,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:01:49,832 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2024-11-09 08:01:49,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:01:49,899 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;@1203230f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:01:49,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2024-11-09 08:01:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 80 states have (on average 2.1) internal successors, (168), 152 states have internal predecessors, (168), 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-11-09 08:01:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:01:49,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:49,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:01:49,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:01:49,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:49,921 INFO L85 PathProgramCache]: Analyzing trace with hash 896780786, now seen corresponding path program 1 times [2024-11-09 08:01:49,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:49,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251855247] [2024-11-09 08:01:49,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:49,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:01:50,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:50,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251855247] [2024-11-09 08:01:50,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251855247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:01:50,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:01:50,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:01:50,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697943652] [2024-11-09 08:01:50,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:01:50,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:01:50,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:50,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:01:50,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:01:50,269 INFO L87 Difference]: Start difference. First operand has 157 states, 80 states have (on average 2.1) internal successors, (168), 152 states have internal predecessors, (168), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:01:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:50,462 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2024-11-09 08:01:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:01:50,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 08:01:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:50,473 INFO L225 Difference]: With dead ends: 153 [2024-11-09 08:01:50,473 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 08:01:50,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:01:50,481 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 3 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 242 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:50,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 242 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:01:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 08:01:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-09 08:01:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 77 states have (on average 2.0) internal successors, (154), 145 states have internal predecessors, (154), 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-11-09 08:01:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2024-11-09 08:01:50,519 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 6 [2024-11-09 08:01:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:50,520 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2024-11-09 08:01:50,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:01:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2024-11-09 08:01:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:01:50,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:50,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:01:50,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:01:50,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:01:50,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash 896780787, now seen corresponding path program 1 times [2024-11-09 08:01:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:50,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631936343] [2024-11-09 08:01:50,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:50,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:01:50,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:50,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631936343] [2024-11-09 08:01:50,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631936343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:01:50,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:01:50,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:01:50,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588698847] [2024-11-09 08:01:50,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:01:50,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:01:50,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:50,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:01:50,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:01:50,631 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:01:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:50,734 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2024-11-09 08:01:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:01:50,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 08:01:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:50,736 INFO L225 Difference]: With dead ends: 147 [2024-11-09 08:01:50,736 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 08:01:50,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:01:50,738 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:50,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 243 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:01:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 08:01:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-09 08:01:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 77 states have (on average 1.9610389610389611) internal successors, (151), 142 states have internal predecessors, (151), 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-11-09 08:01:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2024-11-09 08:01:50,747 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 6 [2024-11-09 08:01:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:50,748 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2024-11-09 08:01:50,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:01:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2024-11-09 08:01:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 08:01:50,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:50,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:01:50,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:01:50,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:01:50,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1471319004, now seen corresponding path program 1 times [2024-11-09 08:01:50,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:50,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734442581] [2024-11-09 08:01:50,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:50,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:50,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:01:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:01:50,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:50,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734442581] [2024-11-09 08:01:50,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734442581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:01:50,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:01:50,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:01:50,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787902549] [2024-11-09 08:01:50,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:01:50,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:01:50,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:50,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:01:50,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:01:50,954 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 08:01:51,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:51,134 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2024-11-09 08:01:51,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:01:51,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-11-09 08:01:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:51,136 INFO L225 Difference]: With dead ends: 158 [2024-11-09 08:01:51,136 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 08:01:51,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:01:51,139 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 10 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:51,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 356 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:01:51,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 08:01:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2024-11-09 08:01:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 78 states have (on average 1.9487179487179487) internal successors, (152), 143 states have internal predecessors, (152), 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-11-09 08:01:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2024-11-09 08:01:51,163 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 14 [2024-11-09 08:01:51,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:51,163 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2024-11-09 08:01:51,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 08:01:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2024-11-09 08:01:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:01:51,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:51,165 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:01:51,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:01:51,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:01:51,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:51,166 INFO L85 PathProgramCache]: Analyzing trace with hash -914713696, now seen corresponding path program 1 times [2024-11-09 08:01:51,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:51,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428548370] [2024-11-09 08:01:51,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:51,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:51,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:01:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:51,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:01:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:01:51,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:51,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428548370] [2024-11-09 08:01:51,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428548370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:01:51,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:01:51,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:01:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304446748] [2024-11-09 08:01:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:01:51,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:01:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:51,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:01:51,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:01:51,520 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:01:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:51,838 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2024-11-09 08:01:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:01:51,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-09 08:01:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:51,840 INFO L225 Difference]: With dead ends: 147 [2024-11-09 08:01:51,843 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 08:01:51,843 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-11-09 08:01:51,844 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 7 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:51,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 502 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:01:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 08:01:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-09 08:01:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 78 states have (on average 1.935897435897436) internal successors, (151), 142 states have internal predecessors, (151), 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-11-09 08:01:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2024-11-09 08:01:51,859 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 24 [2024-11-09 08:01:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:51,860 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2024-11-09 08:01:51,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:01:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2024-11-09 08:01:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:01:51,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:51,861 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:01:51,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:01:51,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:01:51,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:51,866 INFO L85 PathProgramCache]: Analyzing trace with hash -914713695, now seen corresponding path program 1 times [2024-11-09 08:01:51,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:51,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775071855] [2024-11-09 08:01:51,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:51,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:52,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:01:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:52,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:01:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:01:52,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:52,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775071855] [2024-11-09 08:01:52,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775071855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:01:52,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:01:52,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:01:52,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490262368] [2024-11-09 08:01:52,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:01:52,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:01:52,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:52,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:01:52,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:01:52,198 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-11-09 08:01:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:52,510 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2024-11-09 08:01:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:01:52,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2024-11-09 08:01:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:52,512 INFO L225 Difference]: With dead ends: 146 [2024-11-09 08:01:52,512 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 08:01:52,513 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-11-09 08:01:52,514 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:52,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 526 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:01:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 08:01:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-09 08:01:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 78 states have (on average 1.9230769230769231) internal successors, (150), 141 states have internal predecessors, (150), 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-11-09 08:01:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2024-11-09 08:01:52,521 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 24 [2024-11-09 08:01:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:52,521 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2024-11-09 08:01:52,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-11-09 08:01:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2024-11-09 08:01:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:01:52,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:52,523 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:01:52,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:01:52,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:01:52,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1428433537, now seen corresponding path program 1 times [2024-11-09 08:01:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:52,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69628377] [2024-11-09 08:01:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:52,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:01:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:52,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:01:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:01:52,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:52,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69628377] [2024-11-09 08:01:52,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69628377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:01:52,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983137468] [2024-11-09 08:01:52,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:52,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:01:52,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:01:52,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:01:52,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 08:01:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:53,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 08:01:53,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:01:53,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:01:53,144 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-11-09 08:01:53,185 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:01:53,186 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-11-09 08:01:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 08:01:53,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:01:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:01:53,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983137468] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:01:53,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:01:53,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-09 08:01:53,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271829042] [2024-11-09 08:01:53,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:01:53,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 08:01:53,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:53,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 08:01:53,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-09 08:01:53,406 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 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-11-09 08:01:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:54,000 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2024-11-09 08:01:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:01:54,000 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 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 26 [2024-11-09 08:01:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:54,002 INFO L225 Difference]: With dead ends: 151 [2024-11-09 08:01:54,002 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 08:01:54,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 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-11-09 08:01:54,003 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:54,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 772 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 737 Invalid, 0 Unknown, 157 Unchecked, 0.5s Time] [2024-11-09 08:01:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 08:01:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-09 08:01:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 82 states have (on average 1.9024390243902438) internal successors, (156), 145 states have internal predecessors, (156), 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-11-09 08:01:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2024-11-09 08:01:54,017 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 26 [2024-11-09 08:01:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:54,017 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2024-11-09 08:01:54,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 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-11-09 08:01:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2024-11-09 08:01:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:01:54,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:54,018 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:01:54,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 08:01:54,219 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-11-09 08:01:54,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:01:54,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:54,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1428433538, now seen corresponding path program 1 times [2024-11-09 08:01:54,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:54,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368587155] [2024-11-09 08:01:54,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:54,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:54,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:01:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:54,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:01:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:01:54,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:54,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368587155] [2024-11-09 08:01:54,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368587155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:01:54,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741591085] [2024-11-09 08:01:54,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:54,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:01:54,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:01:54,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:01:54,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 08:01:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:54,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 08:01:54,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:01:54,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:01:54,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:01:55,155 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:01:55,156 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-11-09 08:01:55,178 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:01:55,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:01:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:01:55,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:01:55,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741591085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:01:55,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:01:55,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-09 08:01:55,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951500462] [2024-11-09 08:01:55,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:01:55,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 08:01:55,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:55,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 08:01:55,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-09 08:01:55,382 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 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-11-09 08:01:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:56,211 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2024-11-09 08:01:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 08:01:56,212 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 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 26 [2024-11-09 08:01:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:56,213 INFO L225 Difference]: With dead ends: 151 [2024-11-09 08:01:56,213 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 08:01:56,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2024-11-09 08:01:56,214 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:56,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 917 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 08:01:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 08:01:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-09 08:01:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 82 states have (on average 1.8902439024390243) internal successors, (155), 145 states have internal predecessors, (155), 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-11-09 08:01:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2024-11-09 08:01:56,228 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 26 [2024-11-09 08:01:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:56,228 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2024-11-09 08:01:56,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 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-11-09 08:01:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2024-11-09 08:01:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 08:01:56,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:56,229 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] [2024-11-09 08:01:56,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 08:01:56,430 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-11-09 08:01:56,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:01:56,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1664751529, now seen corresponding path program 1 times [2024-11-09 08:01:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657000913] [2024-11-09 08:01:56,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:56,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:56,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:01:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:56,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:01:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:01:56,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:56,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657000913] [2024-11-09 08:01:56,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657000913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:01:56,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395865304] [2024-11-09 08:01:56,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:56,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:01:56,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:01:56,570 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:01:56,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 08:01:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:56,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 08:01:56,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:01:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:01:56,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:01:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:01:56,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395865304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:01:56,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:01:56,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-09 08:01:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765078327] [2024-11-09 08:01:56,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:01:56,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:01:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:56,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:01:56,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:01:56,767 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 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-11-09 08:01:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:56,918 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2024-11-09 08:01:56,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:01:56,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 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 28 [2024-11-09 08:01:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:56,921 INFO L225 Difference]: With dead ends: 151 [2024-11-09 08:01:56,921 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 08:01:56,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 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-11-09 08:01:56,922 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:56,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 761 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:01:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 08:01:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-09 08:01:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 82 states have (on average 1.8780487804878048) internal successors, (154), 145 states have internal predecessors, (154), 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-11-09 08:01:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2024-11-09 08:01:56,928 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 28 [2024-11-09 08:01:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:56,929 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2024-11-09 08:01:56,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 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-11-09 08:01:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2024-11-09 08:01:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:01:56,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:56,931 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] [2024-11-09 08:01:56,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 08:01:57,132 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-11-09 08:01:57,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:01:57,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:57,133 INFO L85 PathProgramCache]: Analyzing trace with hash -72470510, now seen corresponding path program 1 times [2024-11-09 08:01:57,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:57,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844852977] [2024-11-09 08:01:57,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:57,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:57,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:01:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:01:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:01:57,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844852977] [2024-11-09 08:01:57,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844852977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:01:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872888742] [2024-11-09 08:01:57,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:57,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:01:57,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:01:57,245 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:01:57,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 08:01:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:57,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 08:01:57,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:01:57,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:01:57,448 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-11-09 08:01:57,492 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 08:01:57,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 08:01:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-09 08:01:57,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:01:57,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872888742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:01:57,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:01:57,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2024-11-09 08:01:57,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346169223] [2024-11-09 08:01:57,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:01:57,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:01:57,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:57,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:01:57,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2024-11-09 08:01:57,564 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 8 states have internal predecessors, (38), 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-11-09 08:01:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:57,972 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2024-11-09 08:01:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:01:57,972 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 8 states have internal predecessors, (38), 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 29 [2024-11-09 08:01:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:57,973 INFO L225 Difference]: With dead ends: 150 [2024-11-09 08:01:57,973 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 08:01:57,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 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-11-09 08:01:57,974 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 9 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:57,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 630 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 572 Invalid, 0 Unknown, 154 Unchecked, 0.4s Time] [2024-11-09 08:01:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 08:01:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-09 08:01:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 82 states have (on average 1.8658536585365855) internal successors, (153), 144 states have internal predecessors, (153), 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-11-09 08:01:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2024-11-09 08:01:57,981 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 29 [2024-11-09 08:01:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:57,982 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2024-11-09 08:01:57,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 8 states have internal predecessors, (38), 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-11-09 08:01:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2024-11-09 08:01:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:01:57,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:57,986 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] [2024-11-09 08:01:58,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 08:01:58,186 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-11-09 08:01:58,187 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:01:58,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash -72470509, now seen corresponding path program 1 times [2024-11-09 08:01:58,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:58,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35078715] [2024-11-09 08:01:58,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:58,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:58,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:01:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:58,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:01:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:01:58,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:58,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35078715] [2024-11-09 08:01:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35078715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:01:58,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557443190] [2024-11-09 08:01:58,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:58,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:01:58,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:01:58,417 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:01:58,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 08:01:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:58,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 08:01:58,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:01:58,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:01:58,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:01:58,712 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-11-09 08:01:58,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:01:58,750 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-11-09 08:01:58,757 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:01:58,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:01:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 08:01:58,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:01:58,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557443190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:01:58,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:01:58,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-09 08:01:58,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484508490] [2024-11-09 08:01:58,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:01:58,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 08:01:58,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:58,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 08:01:58,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-11-09 08:01:58,905 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 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-11-09 08:01:59,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:59,318 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2024-11-09 08:01:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 08:01:59,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 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 29 [2024-11-09 08:01:59,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:59,321 INFO L225 Difference]: With dead ends: 167 [2024-11-09 08:01:59,321 INFO L226 Difference]: Without dead ends: 167 [2024-11-09 08:01:59,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-11-09 08:01:59,322 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 24 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:59,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 940 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 440 Invalid, 0 Unknown, 176 Unchecked, 0.3s Time] [2024-11-09 08:01:59,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-09 08:01:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2024-11-09 08:01:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 91 states have (on average 1.835164835164835) internal successors, (167), 153 states have internal predecessors, (167), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:01:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 177 transitions. [2024-11-09 08:01:59,327 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 177 transitions. Word has length 29 [2024-11-09 08:01:59,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:59,327 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 177 transitions. [2024-11-09 08:01:59,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 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-11-09 08:01:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 177 transitions. [2024-11-09 08:01:59,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:01:59,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:59,328 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] [2024-11-09 08:01:59,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 08:01:59,529 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-11-09 08:01:59,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:01:59,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:59,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2048381491, now seen corresponding path program 1 times [2024-11-09 08:01:59,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:59,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700896257] [2024-11-09 08:01:59,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:59,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:59,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:01:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:59,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:01:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:01:59,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:59,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700896257] [2024-11-09 08:01:59,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700896257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:01:59,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:01:59,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 08:01:59,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728722328] [2024-11-09 08:01:59,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:01:59,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:01:59,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:59,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:01:59,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:01:59,677 INFO L87 Difference]: Start difference. First operand 160 states and 177 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-11-09 08:01:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:59,973 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2024-11-09 08:01:59,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:01:59,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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 30 [2024-11-09 08:01:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:59,975 INFO L225 Difference]: With dead ends: 159 [2024-11-09 08:01:59,975 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 08:01:59,975 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-11-09 08:01:59,976 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 7 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:59,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 565 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:01:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 08:01:59,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-09 08:01:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 91 states have (on average 1.8241758241758241) internal successors, (166), 152 states have internal predecessors, (166), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:01:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 176 transitions. [2024-11-09 08:01:59,981 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 176 transitions. Word has length 30 [2024-11-09 08:01:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:59,981 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 176 transitions. [2024-11-09 08:01:59,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-11-09 08:01:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 176 transitions. [2024-11-09 08:01:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:01:59,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:59,982 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] [2024-11-09 08:01:59,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 08:01:59,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:01:59,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2048381492, now seen corresponding path program 1 times [2024-11-09 08:01:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:59,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589375729] [2024-11-09 08:01:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:59,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:00,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:00,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589375729] [2024-11-09 08:02:00,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589375729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:00,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:00,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 08:02:00,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902292972] [2024-11-09 08:02:00,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:00,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:02:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:00,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:02:00,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:02:00,296 INFO L87 Difference]: Start difference. First operand 159 states and 176 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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-11-09 08:02:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:00,597 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2024-11-09 08:02:00,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:00,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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 30 [2024-11-09 08:02:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:00,599 INFO L225 Difference]: With dead ends: 158 [2024-11-09 08:02:00,599 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 08:02:00,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:02:00,600 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 9 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:00,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 730 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:02:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 08:02:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-09 08:02:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 91 states have (on average 1.8131868131868132) internal successors, (165), 151 states have internal predecessors, (165), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:02:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2024-11-09 08:02:00,604 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 30 [2024-11-09 08:02:00,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:00,604 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2024-11-09 08:02:00,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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-11-09 08:02:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2024-11-09 08:02:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 08:02:00,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:00,605 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:00,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 08:02:00,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:00,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash 409808311, now seen corresponding path program 1 times [2024-11-09 08:02:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:00,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497457281] [2024-11-09 08:02:00,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 08:02:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 08:02:00,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:00,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497457281] [2024-11-09 08:02:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497457281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:00,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47682306] [2024-11-09 08:02:00,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:00,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:00,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:00,733 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:00,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 08:02:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:02:00,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:02:00,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47682306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:00,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:00,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-09 08:02:00,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596163443] [2024-11-09 08:02:00,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:00,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:00,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:00,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:00,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:00,932 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:00,948 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2024-11-09 08:02:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:00,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-09 08:02:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:00,950 INFO L225 Difference]: With dead ends: 140 [2024-11-09 08:02:00,950 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 08:02:00,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:00,950 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:00,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 422 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 08:02:00,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-09 08:02:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 135 states have internal predecessors, (142), 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-11-09 08:02:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2024-11-09 08:02:00,955 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 41 [2024-11-09 08:02:00,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:00,955 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2024-11-09 08:02:00,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2024-11-09 08:02:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:02:00,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:00,960 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:00,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:01,160 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-11-09 08:02:01,161 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:01,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1648035753, now seen corresponding path program 1 times [2024-11-09 08:02:01,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:01,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094190715] [2024-11-09 08:02:01,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:01,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:01,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:01,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:01,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:02:01,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:01,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094190715] [2024-11-09 08:02:01,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094190715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:01,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642041963] [2024-11-09 08:02:01,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:01,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:01,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:01,686 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:01,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 08:02:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:01,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 08:02:01,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:01,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:02:01,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 08:02:01,907 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-11-09 08:02:01,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:01,940 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-11-09 08:02:01,951 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-11-09 08:02:02,002 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:02:02,002 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-11-09 08:02:02,064 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:02:02,064 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-11-09 08:02:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2024-11-09 08:02:02,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:02,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642041963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:02,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:02,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-11-09 08:02:02,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027942982] [2024-11-09 08:02:02,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:02,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 08:02:02,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:02,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 08:02:02,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2024-11-09 08:02:02,357 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 08:02:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:02,802 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2024-11-09 08:02:02,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:02,803 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2024-11-09 08:02:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:02,804 INFO L225 Difference]: With dead ends: 149 [2024-11-09 08:02:02,804 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 08:02:02,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=186, Unknown=2, NotChecked=58, Total=306 [2024-11-09 08:02:02,804 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 272 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:02,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 391 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 529 Invalid, 0 Unknown, 302 Unchecked, 0.4s Time] [2024-11-09 08:02:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 08:02:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 130. [2024-11-09 08:02:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 125 states have internal predecessors, (132), 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-11-09 08:02:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2024-11-09 08:02:02,808 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 43 [2024-11-09 08:02:02,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:02,808 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2024-11-09 08:02:02,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 08:02:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2024-11-09 08:02:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:02:02,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:02,809 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:02,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 08:02:03,009 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-11-09 08:02:03,010 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:03,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:03,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1648035752, now seen corresponding path program 1 times [2024-11-09 08:02:03,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:03,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218654874] [2024-11-09 08:02:03,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:03,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:02:03,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:03,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218654874] [2024-11-09 08:02:03,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218654874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:03,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004911675] [2024-11-09 08:02:03,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:03,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:03,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:03,665 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:03,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 08:02:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 08:02:03,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:03,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:02:03,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 08:02:03,914 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-11-09 08:02:03,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:03,959 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-11-09 08:02:03,980 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-11-09 08:02:04,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:04,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-11-09 08:02:04,091 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-11-09 08:02:04,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:04,152 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-11-09 08:02:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 08:02:04,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:04,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004911675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:04,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:04,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-09 08:02:04,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978861463] [2024-11-09 08:02:04,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:04,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:02:04,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:04,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:02:04,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-11-09 08:02:04,162 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-11-09 08:02:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:04,307 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2024-11-09 08:02:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 43 [2024-11-09 08:02:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:04,308 INFO L225 Difference]: With dead ends: 124 [2024-11-09 08:02:04,308 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 08:02:04,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-11-09 08:02:04,308 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 52 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:04,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 281 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 164 Unchecked, 0.1s Time] [2024-11-09 08:02:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 08:02:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-09 08:02:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.6025641025641026) internal successors, (125), 118 states have internal predecessors, (125), 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-11-09 08:02:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2024-11-09 08:02:04,312 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 43 [2024-11-09 08:02:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:04,312 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2024-11-09 08:02:04,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-11-09 08:02:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2024-11-09 08:02:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 08:02:04,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:04,313 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:04,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:04,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 08:02:04,514 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:04,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash -861940870, now seen corresponding path program 1 times [2024-11-09 08:02:04,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:04,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719402575] [2024-11-09 08:02:04,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:04,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:04,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:04,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:04,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 08:02:04,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:04,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719402575] [2024-11-09 08:02:04,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719402575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:04,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270953385] [2024-11-09 08:02:04,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:04,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:04,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:04,957 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:04,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 08:02:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:05,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 08:02:05,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:05,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 08:02:05,352 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-11-09 08:02:05,375 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-09 08:02:05,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 08:02:05,405 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-11-09 08:02:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:02:05,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:05,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270953385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:05,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:05,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2024-11-09 08:02:05,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943260182] [2024-11-09 08:02:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:05,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:02:05,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:05,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:02:05,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2024-11-09 08:02:05,414 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:05,678 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2024-11-09 08:02:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 08:02:05,678 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-09 08:02:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:05,679 INFO L225 Difference]: With dead ends: 167 [2024-11-09 08:02:05,679 INFO L226 Difference]: Without dead ends: 167 [2024-11-09 08:02:05,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=444, Unknown=1, NotChecked=42, Total=552 [2024-11-09 08:02:05,680 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 140 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:05,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 440 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 246 Unchecked, 0.2s Time] [2024-11-09 08:02:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-09 08:02:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 130. [2024-11-09 08:02:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 125 states have internal predecessors, (142), 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-11-09 08:02:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2024-11-09 08:02:05,684 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 46 [2024-11-09 08:02:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:05,684 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2024-11-09 08:02:05,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2024-11-09 08:02:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 08:02:05,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:05,685 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:05,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 08:02:05,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 08:02:05,885 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:05,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash -861940869, now seen corresponding path program 1 times [2024-11-09 08:02:05,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:05,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875335705] [2024-11-09 08:02:05,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:05,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:02:06,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:06,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875335705] [2024-11-09 08:02:06,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875335705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:06,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398660251] [2024-11-09 08:02:06,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:06,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:06,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:06,615 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-11-09 08:02:06,617 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-11-09 08:02:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 08:02:06,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:06,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:02:07,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 08:02:07,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 08:02:07,232 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2024-11-09 08:02:07,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:07,280 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-11-09 08:02:07,288 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 08:02:07,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 08:02:07,338 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-11-09 08:02:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-09 08:02:07,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:07,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398660251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:07,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:07,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2024-11-09 08:02:07,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108435526] [2024-11-09 08:02:07,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:07,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 08:02:07,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:07,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 08:02:07,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=967, Unknown=1, NotChecked=62, Total=1122 [2024-11-09 08:02:07,577 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 30 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:02:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:08,819 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2024-11-09 08:02:08,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 08:02:08,820 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2024-11-09 08:02:08,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:08,821 INFO L225 Difference]: With dead ends: 175 [2024-11-09 08:02:08,821 INFO L226 Difference]: Without dead ends: 175 [2024-11-09 08:02:08,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=187, Invalid=1978, Unknown=1, NotChecked=90, Total=2256 [2024-11-09 08:02:08,823 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 396 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:08,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1228 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1610 Invalid, 0 Unknown, 178 Unchecked, 0.9s Time] [2024-11-09 08:02:08,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-09 08:02:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 138. [2024-11-09 08:02:08,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 132 states have internal predecessors, (147), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2024-11-09 08:02:08,828 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 46 [2024-11-09 08:02:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:08,828 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2024-11-09 08:02:08,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:02:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2024-11-09 08:02:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 08:02:08,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:08,829 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:08,851 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-11-09 08:02:09,030 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,SelfDestructingSolverStorable16 [2024-11-09 08:02:09,030 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:09,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:09,031 INFO L85 PathProgramCache]: Analyzing trace with hash -950364801, now seen corresponding path program 1 times [2024-11-09 08:02:09,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:09,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062055381] [2024-11-09 08:02:09,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:09,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 08:02:09,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:09,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062055381] [2024-11-09 08:02:09,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062055381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:09,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:09,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:02:09,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223114671] [2024-11-09 08:02:09,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:09,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:09,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:09,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:09,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:02:09,133 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:09,239 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2024-11-09 08:02:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:09,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-09 08:02:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:09,241 INFO L225 Difference]: With dead ends: 134 [2024-11-09 08:02:09,241 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 08:02:09,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:02:09,243 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:09,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 08:02:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-09 08:02:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 88 states have (on average 1.5454545454545454) internal successors, (136), 128 states have internal predecessors, (136), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2024-11-09 08:02:09,249 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 47 [2024-11-09 08:02:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:09,250 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2024-11-09 08:02:09,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2024-11-09 08:02:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 08:02:09,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:09,251 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:09,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 08:02:09,251 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:09,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1527893536, now seen corresponding path program 1 times [2024-11-09 08:02:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:09,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442874563] [2024-11-09 08:02:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:09,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 08:02:09,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442874563] [2024-11-09 08:02:09,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442874563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:09,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:09,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:02:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417007231] [2024-11-09 08:02:09,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:09,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:02:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:09,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:02:09,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:09,400 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:09,655 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2024-11-09 08:02:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:09,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-09 08:02:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:09,657 INFO L225 Difference]: With dead ends: 128 [2024-11-09 08:02:09,657 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 08:02:09,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:09,657 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 33 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:09,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 367 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 08:02:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-09 08:02:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 122 states have internal predecessors, (130), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2024-11-09 08:02:09,662 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 49 [2024-11-09 08:02:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:09,662 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2024-11-09 08:02:09,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2024-11-09 08:02:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 08:02:09,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:09,663 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:09,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 08:02:09,663 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:09,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1527893537, now seen corresponding path program 1 times [2024-11-09 08:02:09,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:09,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576996996] [2024-11-09 08:02:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:09,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:02:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576996996] [2024-11-09 08:02:09,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576996996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713403907] [2024-11-09 08:02:09,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:09,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:09,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:09,929 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-11-09 08:02:09,930 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-11-09 08:02:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:10,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 08:02:10,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 08:02:10,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713403907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:10,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2024-11-09 08:02:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454623495] [2024-11-09 08:02:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:10,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:10,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:10,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:02:10,251 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-11-09 08:02:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:10,272 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2024-11-09 08:02:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:10,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 49 [2024-11-09 08:02:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:10,273 INFO L225 Difference]: With dead ends: 131 [2024-11-09 08:02:10,273 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 08:02:10,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-09 08:02:10,274 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 73 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:10,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 274 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 08:02:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2024-11-09 08:02:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.471264367816092) internal successors, (128), 121 states have internal predecessors, (128), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2024-11-09 08:02:10,279 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 49 [2024-11-09 08:02:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:10,280 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2024-11-09 08:02:10,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-11-09 08:02:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2024-11-09 08:02:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 08:02:10,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:10,282 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-11-09 08:02:10,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 08:02:10,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:10,483 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:10,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1529033284, now seen corresponding path program 1 times [2024-11-09 08:02:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:10,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128830202] [2024-11-09 08:02:10,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:10,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:10,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:10,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 08:02:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:10,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128830202] [2024-11-09 08:02:10,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128830202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:10,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:10,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:02:10,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732818687] [2024-11-09 08:02:10,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:10,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:02:10,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:10,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:02:10,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:10,663 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-11-09 08:02:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:10,784 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2024-11-09 08:02:10,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:02:10,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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 49 [2024-11-09 08:02:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:10,785 INFO L225 Difference]: With dead ends: 128 [2024-11-09 08:02:10,785 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 08:02:10,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:10,786 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 66 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:10,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 430 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 08:02:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2024-11-09 08:02:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 86 states have (on average 1.441860465116279) internal successors, (124), 118 states have internal predecessors, (124), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2024-11-09 08:02:10,789 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 49 [2024-11-09 08:02:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:10,790 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2024-11-09 08:02:10,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-11-09 08:02:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2024-11-09 08:02:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 08:02:10,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:10,791 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:10,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 08:02:10,791 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:10,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash 155389941, now seen corresponding path program 1 times [2024-11-09 08:02:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:10,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064154530] [2024-11-09 08:02:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:10,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:10,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:10,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 08:02:10,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:10,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064154530] [2024-11-09 08:02:10,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064154530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:10,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:10,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:02:10,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419072721] [2024-11-09 08:02:10,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:10,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:02:10,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:10,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:02:10,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:10,892 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:11,024 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2024-11-09 08:02:11,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:02:11,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 08:02:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:11,025 INFO L225 Difference]: With dead ends: 123 [2024-11-09 08:02:11,025 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 08:02:11,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:11,026 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:11,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 295 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 08:02:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 08:02:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.430232558139535) internal successors, (123), 117 states have internal predecessors, (123), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2024-11-09 08:02:11,029 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 50 [2024-11-09 08:02:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:11,030 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2024-11-09 08:02:11,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2024-11-09 08:02:11,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 08:02:11,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:11,030 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:11,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 08:02:11,031 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:11,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:11,031 INFO L85 PathProgramCache]: Analyzing trace with hash 155389942, now seen corresponding path program 1 times [2024-11-09 08:02:11,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:11,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846670412] [2024-11-09 08:02:11,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:11,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:02:11,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:11,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846670412] [2024-11-09 08:02:11,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846670412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:11,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437238991] [2024-11-09 08:02:11,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:11,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:11,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:11,781 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-11-09 08:02:11,782 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-11-09 08:02:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:12,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 08:02:12,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:12,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 08:02:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 08:02:12,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:12,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437238991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:12,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [17] total 19 [2024-11-09 08:02:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192496938] [2024-11-09 08:02:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-11-09 08:02:12,309 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:12,391 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2024-11-09 08:02:12,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:12,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 08:02:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:12,392 INFO L225 Difference]: With dead ends: 122 [2024-11-09 08:02:12,392 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 08:02:12,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-11-09 08:02:12,393 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 282 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-11-09 08:02:12,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 282 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 08:02:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 08:02:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 116 states have internal predecessors, (122), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2024-11-09 08:02:12,397 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 50 [2024-11-09 08:02:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:12,398 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2024-11-09 08:02:12,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2024-11-09 08:02:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 08:02:12,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:12,401 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:12,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:12,602 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,SelfDestructingSolverStorable22 [2024-11-09 08:02:12,602 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:12,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 522120915, now seen corresponding path program 1 times [2024-11-09 08:02:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:12,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181921341] [2024-11-09 08:02:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:12,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:12,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:12,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:12,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 08:02:12,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:12,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181921341] [2024-11-09 08:02:12,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181921341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:12,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:12,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:02:12,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860393680] [2024-11-09 08:02:12,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:12,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:02:12,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:12,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:02:12,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:12,900 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:13,093 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2024-11-09 08:02:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:13,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-11-09 08:02:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:13,095 INFO L225 Difference]: With dead ends: 116 [2024-11-09 08:02:13,095 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 08:02:13,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-11-09 08:02:13,095 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 26 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:13,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 371 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 08:02:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 08:02:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 110 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2024-11-09 08:02:13,100 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 51 [2024-11-09 08:02:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:13,101 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2024-11-09 08:02:13,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2024-11-09 08:02:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 08:02:13,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:13,102 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:13,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 08:02:13,103 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:13,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:13,103 INFO L85 PathProgramCache]: Analyzing trace with hash -752973931, now seen corresponding path program 1 times [2024-11-09 08:02:13,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:13,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988444436] [2024-11-09 08:02:13,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:13,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:02:14,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:14,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988444436] [2024-11-09 08:02:14,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988444436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:14,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548222453] [2024-11-09 08:02:14,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:14,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:14,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:14,548 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-11-09 08:02:14,550 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-11-09 08:02:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:15,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-09 08:02:15,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:15,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:02:15,338 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:15,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:02:15,427 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-11-09 08:02:15,492 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-11-09 08:02:15,591 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-11-09 08:02:15,649 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 33 treesize of output 24 [2024-11-09 08:02:15,856 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 49 treesize of output 17 [2024-11-09 08:02:15,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 08:02:16,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:16,137 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 34 [2024-11-09 08:02:16,167 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-09 08:02:16,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-09 08:02:16,316 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 49 [2024-11-09 08:02:16,451 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 44 treesize of output 20 [2024-11-09 08:02:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:16,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:17,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548222453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:17,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:17,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 50 [2024-11-09 08:02:17,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117900468] [2024-11-09 08:02:17,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:17,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-09 08:02:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-09 08:02:17,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3116, Unknown=0, NotChecked=0, Total=3306 [2024-11-09 08:02:17,058 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 51 states, 47 states have (on average 1.872340425531915) internal successors, (88), 43 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 08:02:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:19,197 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2024-11-09 08:02:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 08:02:19,197 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.872340425531915) internal successors, (88), 43 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2024-11-09 08:02:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:19,198 INFO L225 Difference]: With dead ends: 117 [2024-11-09 08:02:19,198 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 08:02:19,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=426, Invalid=6054, Unknown=0, NotChecked=0, Total=6480 [2024-11-09 08:02:19,200 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 125 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:19,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1632 Invalid, 2314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 08:02:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 08:02:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2024-11-09 08:02:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 109 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2024-11-09 08:02:19,204 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 53 [2024-11-09 08:02:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:19,205 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2024-11-09 08:02:19,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.872340425531915) internal successors, (88), 43 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 08:02:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2024-11-09 08:02:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 08:02:19,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:19,206 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:19,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 08:02:19,406 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,SelfDestructingSolverStorable24 [2024-11-09 08:02:19,407 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 08:02:19,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:19,407 INFO L85 PathProgramCache]: Analyzing trace with hash -752973930, now seen corresponding path program 1 times [2024-11-09 08:02:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:19,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100977587] [2024-11-09 08:02:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:20,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:20,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:02:21,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:21,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100977587] [2024-11-09 08:02:21,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100977587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591254527] [2024-11-09 08:02:21,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:21,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:21,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:21,501 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-11-09 08:02:21,502 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-11-09 08:02:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-11-09 08:02:21,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:21,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:02:21,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:02:22,115 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:02:22,115 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-11-09 08:02:22,125 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:22,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:02:22,219 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-11-09 08:02:22,223 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-11-09 08:02:22,328 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:02:22,328 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-11-09 08:02:22,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 08:02:22,477 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:02:22,477 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 16 treesize of output 15 [2024-11-09 08:02:22,490 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 08:02:22,490 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-11-09 08:02:22,546 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-09 08:02:22,546 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 27 treesize of output 17 [2024-11-09 08:02:22,561 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-09 08:02:22,561 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 35 treesize of output 26 [2024-11-09 08:02:22,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:22,851 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 116 treesize of output 73 [2024-11-09 08:02:22,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2024-11-09 08:02:22,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:22,865 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 59 [2024-11-09 08:02:22,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 08:02:23,376 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:02:23,376 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 125 treesize of output 98 [2024-11-09 08:02:23,411 INFO L349 Elim1Store]: treesize reduction 38, result has 50.6 percent of original size [2024-11-09 08:02:23,411 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 3 case distinctions, treesize of input 87 treesize of output 114 [2024-11-09 08:02:23,437 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:02:23,438 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 83 treesize of output 86 [2024-11-09 08:02:23,695 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2024-11-09 08:02:23,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2024-11-09 08:02:23,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:23,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 81 [2024-11-09 08:02:23,819 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 08:02:23,819 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 29 treesize of output 17 [2024-11-09 08:02:23,855 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 08:02:23,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 08:02:24,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 195 [2024-11-09 08:02:24,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:24,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 216 [2024-11-09 08:02:25,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:25,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 187 treesize of output 299 [2024-11-09 08:02:25,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:25,247 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 115 treesize of output 115