./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:58:00,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:58:00,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:58:00,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:58:00,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:58:00,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:58:00,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:58:00,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:58:00,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:58:00,929 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:58:00,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:58:00,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:58:00,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:58:00,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:58:00,931 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:58:00,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:58:00,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:58:00,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:58:00,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:58:00,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:58:00,936 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:58:00,936 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:58:00,937 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:58:00,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:58:00,937 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:58:00,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:58:00,937 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:58:00,937 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:58:00,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:58:00,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:58:00,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:58:00,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:58:00,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:58:00,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:58:00,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:58:00,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:58:00,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:58:00,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:58:00,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:58:00,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:58:00,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:58:00,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:58:00,941 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 -> 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 [2024-10-14 17:58:01,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:58:01,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:58:01,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:58:01,188 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:58:01,189 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:58:01,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2024-10-14 17:58:02,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:58:02,766 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:58:02,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2024-10-14 17:58:02,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0625c623/6995076eeee04bc090fd5c95d5820035/FLAG12b763458 [2024-10-14 17:58:02,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0625c623/6995076eeee04bc090fd5c95d5820035 [2024-10-14 17:58:02,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:58:02,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:58:02,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:58:02,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:58:02,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:58:02,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:58:02" (1/1) ... [2024-10-14 17:58:02,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6386631f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:02, skipping insertion in model container [2024-10-14 17:58:02,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:58:02" (1/1) ... [2024-10-14 17:58:02,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:58:03,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:58:03,099 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:58:03,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:58:03,184 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:58:03,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03 WrapperNode [2024-10-14 17:58:03,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:58:03,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:58:03,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:58:03,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:58:03,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (1/1) ... [2024-10-14 17:58:03,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (1/1) ... [2024-10-14 17:58:03,235 INFO L138 Inliner]: procedures = 125, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 367 [2024-10-14 17:58:03,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:58:03,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:58:03,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:58:03,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:58:03,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (1/1) ... [2024-10-14 17:58:03,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (1/1) ... [2024-10-14 17:58:03,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (1/1) ... [2024-10-14 17:58:03,266 INFO L175 MemorySlicer]: Split 66 memory accesses to 3 slices as follows [2, 54, 10]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 6, 5]. [2024-10-14 17:58:03,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (1/1) ... [2024-10-14 17:58:03,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (1/1) ... [2024-10-14 17:58:03,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (1/1) ... [2024-10-14 17:58:03,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (1/1) ... [2024-10-14 17:58:03,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (1/1) ... [2024-10-14 17:58:03,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (1/1) ... [2024-10-14 17:58:03,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:58:03,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:58:03,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:58:03,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:58:03,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (1/1) ... [2024-10-14 17:58:03,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:58:03,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:58:03,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:58:03,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:58:03,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 17:58:03,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 17:58:03,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 17:58:03,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 17:58:03,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 17:58:03,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 17:58:03,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:58:03,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:58:03,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:58:03,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:58:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:58:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:58:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:58:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:58:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:58:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 17:58:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 17:58:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 17:58:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:58:03,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:58:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-10-14 17:58:03,390 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-10-14 17:58:03,572 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:58:03,577 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:58:04,191 INFO L? ?]: Removed 360 outVars from TransFormulas that were not future-live. [2024-10-14 17:58:04,191 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:58:04,250 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:58:04,253 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-14 17:58:04,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:58:04 BoogieIcfgContainer [2024-10-14 17:58:04,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:58:04,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:58:04,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:58:04,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:58:04,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:58:02" (1/3) ... [2024-10-14 17:58:04,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450ed665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:58:04, skipping insertion in model container [2024-10-14 17:58:04,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:03" (2/3) ... [2024-10-14 17:58:04,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450ed665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:58:04, skipping insertion in model container [2024-10-14 17:58:04,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:58:04" (3/3) ... [2024-10-14 17:58:04,265 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2024-10-14 17:58:04,279 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:58:04,279 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2024-10-14 17:58:04,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:58:04,326 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;@6fe46ecb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:58:04,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2024-10-14 17:58:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 293 states, 130 states have (on average 2.4) internal successors, (312), 279 states have internal predecessors, (312), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 17:58:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 17:58:04,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:04,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 17:58:04,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:04,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:04,338 INFO L85 PathProgramCache]: Analyzing trace with hash 18449, now seen corresponding path program 1 times [2024-10-14 17:58:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:04,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585613432] [2024-10-14 17:58:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:04,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:04,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:04,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585613432] [2024-10-14 17:58:04,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585613432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:04,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:04,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:58:04,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414505527] [2024-10-14 17:58:04,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:04,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:58:04,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:04,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:58:04,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:58:04,551 INFO L87 Difference]: Start difference. First operand has 293 states, 130 states have (on average 2.4) internal successors, (312), 279 states have internal predecessors, (312), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:04,901 INFO L93 Difference]: Finished difference Result 498 states and 552 transitions. [2024-10-14 17:58:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:58:04,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 17:58:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:04,914 INFO L225 Difference]: With dead ends: 498 [2024-10-14 17:58:04,914 INFO L226 Difference]: Without dead ends: 497 [2024-10-14 17:58:04,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:58:04,917 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 221 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:04,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 374 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:58:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-14 17:58:05,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 364. [2024-10-14 17:58:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 204 states have (on average 2.3186274509803924) internal successors, (473), 350 states have internal predecessors, (473), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 17:58:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 501 transitions. [2024-10-14 17:58:05,033 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 501 transitions. Word has length 2 [2024-10-14 17:58:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:05,034 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 501 transitions. [2024-10-14 17:58:05,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 501 transitions. [2024-10-14 17:58:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 17:58:05,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:05,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 17:58:05,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:58:05,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:05,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:05,036 INFO L85 PathProgramCache]: Analyzing trace with hash 18450, now seen corresponding path program 1 times [2024-10-14 17:58:05,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:05,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412224228] [2024-10-14 17:58:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:05,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412224228] [2024-10-14 17:58:05,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412224228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:05,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:05,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:58:05,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257276860] [2024-10-14 17:58:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:05,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:58:05,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:05,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:58:05,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:58:05,129 INFO L87 Difference]: Start difference. First operand 364 states and 501 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:05,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:05,296 INFO L93 Difference]: Finished difference Result 365 states and 504 transitions. [2024-10-14 17:58:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:58:05,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 17:58:05,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:05,298 INFO L225 Difference]: With dead ends: 365 [2024-10-14 17:58:05,298 INFO L226 Difference]: Without dead ends: 365 [2024-10-14 17:58:05,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:58:05,301 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 5 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:05,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 471 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:58:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-14 17:58:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2024-10-14 17:58:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 204 states have (on average 2.3088235294117645) internal successors, (471), 348 states have internal predecessors, (471), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 17:58:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 499 transitions. [2024-10-14 17:58:05,325 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 499 transitions. Word has length 2 [2024-10-14 17:58:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:05,325 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 499 transitions. [2024-10-14 17:58:05,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 499 transitions. [2024-10-14 17:58:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:58:05,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:05,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:05,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:58:05,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:05,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1425818485, now seen corresponding path program 1 times [2024-10-14 17:58:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:05,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476212308] [2024-10-14 17:58:05,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:05,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:05,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476212308] [2024-10-14 17:58:05,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476212308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:05,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:05,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:58:05,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952169848] [2024-10-14 17:58:05,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:05,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:58:05,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:05,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:58:05,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:58:05,402 INFO L87 Difference]: Start difference. First operand 362 states and 499 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:05,547 INFO L93 Difference]: Finished difference Result 357 states and 494 transitions. [2024-10-14 17:58:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:58:05,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-10-14 17:58:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:05,548 INFO L225 Difference]: With dead ends: 357 [2024-10-14 17:58:05,549 INFO L226 Difference]: Without dead ends: 357 [2024-10-14 17:58:05,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:58:05,550 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 31 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:05,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 426 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:58:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-14 17:58:05,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-10-14 17:58:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 204 states have (on average 2.284313725490196) internal successors, (466), 343 states have internal predecessors, (466), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 17:58:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 494 transitions. [2024-10-14 17:58:05,559 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 494 transitions. Word has length 8 [2024-10-14 17:58:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:05,559 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 494 transitions. [2024-10-14 17:58:05,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 494 transitions. [2024-10-14 17:58:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:58:05,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:05,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:05,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:58:05,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:05,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:05,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1425818484, now seen corresponding path program 1 times [2024-10-14 17:58:05,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:05,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827089827] [2024-10-14 17:58:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:05,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:05,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:05,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827089827] [2024-10-14 17:58:05,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827089827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:05,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:05,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:58:05,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942664902] [2024-10-14 17:58:05,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:05,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:58:05,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:05,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:58:05,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:58:05,636 INFO L87 Difference]: Start difference. First operand 357 states and 494 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:05,767 INFO L93 Difference]: Finished difference Result 352 states and 489 transitions. [2024-10-14 17:58:05,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:58:05,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-10-14 17:58:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:05,769 INFO L225 Difference]: With dead ends: 352 [2024-10-14 17:58:05,769 INFO L226 Difference]: Without dead ends: 352 [2024-10-14 17:58:05,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:58:05,770 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 31 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:05,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 437 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:58:05,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-14 17:58:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-10-14 17:58:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 204 states have (on average 2.2598039215686274) internal successors, (461), 338 states have internal predecessors, (461), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 17:58:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 489 transitions. [2024-10-14 17:58:05,777 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 489 transitions. Word has length 8 [2024-10-14 17:58:05,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:05,777 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 489 transitions. [2024-10-14 17:58:05,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:05,778 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 489 transitions. [2024-10-14 17:58:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:58:05,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:05,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:05,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:58:05,778 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:05,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:05,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1250699647, now seen corresponding path program 1 times [2024-10-14 17:58:05,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:05,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835831665] [2024-10-14 17:58:05,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:05,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:05,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835831665] [2024-10-14 17:58:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835831665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:05,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:05,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:58:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141807749] [2024-10-14 17:58:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:05,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:58:05,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:58:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:58:05,972 INFO L87 Difference]: Start difference. First operand 352 states and 489 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:06,377 INFO L93 Difference]: Finished difference Result 474 states and 526 transitions. [2024-10-14 17:58:06,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:58:06,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2024-10-14 17:58:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:06,379 INFO L225 Difference]: With dead ends: 474 [2024-10-14 17:58:06,379 INFO L226 Difference]: Without dead ends: 474 [2024-10-14 17:58:06,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:58:06,380 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 288 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:06,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 529 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:58:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-14 17:58:06,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 344. [2024-10-14 17:58:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 204 states have (on average 2.2205882352941178) internal successors, (453), 330 states have internal predecessors, (453), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 17:58:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2024-10-14 17:58:06,389 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 9 [2024-10-14 17:58:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:06,389 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2024-10-14 17:58:06,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2024-10-14 17:58:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:58:06,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:06,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:06,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:58:06,390 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:06,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:06,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1250699646, now seen corresponding path program 1 times [2024-10-14 17:58:06,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:06,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658170353] [2024-10-14 17:58:06,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:06,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:06,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:06,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658170353] [2024-10-14 17:58:06,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658170353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:06,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:06,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:58:06,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660205720] [2024-10-14 17:58:06,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:06,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:58:06,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:06,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:58:06,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:58:06,525 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:07,054 INFO L93 Difference]: Finished difference Result 466 states and 517 transitions. [2024-10-14 17:58:07,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:58:07,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2024-10-14 17:58:07,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:07,056 INFO L225 Difference]: With dead ends: 466 [2024-10-14 17:58:07,056 INFO L226 Difference]: Without dead ends: 466 [2024-10-14 17:58:07,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:58:07,057 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 487 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:07,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 344 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:58:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-14 17:58:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 335. [2024-10-14 17:58:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 204 states have (on average 2.1715686274509802) internal successors, (443), 321 states have internal predecessors, (443), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 17:58:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 471 transitions. [2024-10-14 17:58:07,063 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 471 transitions. Word has length 9 [2024-10-14 17:58:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:07,063 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 471 transitions. [2024-10-14 17:58:07,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 471 transitions. [2024-10-14 17:58:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:58:07,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:07,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:07,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:58:07,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:07,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:07,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1278972761, now seen corresponding path program 1 times [2024-10-14 17:58:07,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:07,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995962870] [2024-10-14 17:58:07,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:07,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:07,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:07,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995962870] [2024-10-14 17:58:07,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995962870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:07,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:07,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:58:07,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470280003] [2024-10-14 17:58:07,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:07,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:58:07,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:07,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:58:07,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:58:07,262 INFO L87 Difference]: Start difference. First operand 335 states and 471 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:07,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:07,529 INFO L93 Difference]: Finished difference Result 353 states and 492 transitions. [2024-10-14 17:58:07,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:58:07,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 16 [2024-10-14 17:58:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:07,531 INFO L225 Difference]: With dead ends: 353 [2024-10-14 17:58:07,531 INFO L226 Difference]: Without dead ends: 353 [2024-10-14 17:58:07,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:58:07,533 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 27 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:07,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1266 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:58:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-14 17:58:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 342. [2024-10-14 17:58:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 210 states have (on average 2.142857142857143) internal successors, (450), 327 states have internal predecessors, (450), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:58:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 480 transitions. [2024-10-14 17:58:07,542 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 480 transitions. Word has length 16 [2024-10-14 17:58:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:07,543 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 480 transitions. [2024-10-14 17:58:07,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 480 transitions. [2024-10-14 17:58:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 17:58:07,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:07,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:07,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:58:07,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:07,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash 209392947, now seen corresponding path program 1 times [2024-10-14 17:58:07,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:07,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88868334] [2024-10-14 17:58:07,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:07,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:07,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:07,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88868334] [2024-10-14 17:58:07,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88868334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:07,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:07,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:58:07,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876435722] [2024-10-14 17:58:07,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:07,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:58:07,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:07,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:58:07,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:58:07,769 INFO L87 Difference]: Start difference. First operand 342 states and 480 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:07,906 INFO L93 Difference]: Finished difference Result 346 states and 484 transitions. [2024-10-14 17:58:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:58:07,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 17 [2024-10-14 17:58:07,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:07,908 INFO L225 Difference]: With dead ends: 346 [2024-10-14 17:58:07,908 INFO L226 Difference]: Without dead ends: 346 [2024-10-14 17:58:07,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:58:07,909 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 9 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:07,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1270 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:58:07,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-14 17:58:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2024-10-14 17:58:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 212 states have (on average 2.1320754716981134) internal successors, (452), 329 states have internal predecessors, (452), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:58:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 482 transitions. [2024-10-14 17:58:07,924 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 482 transitions. Word has length 17 [2024-10-14 17:58:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:07,925 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 482 transitions. [2024-10-14 17:58:07,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 482 transitions. [2024-10-14 17:58:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 17:58:07,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:07,929 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:07,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:58:07,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:07,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:07,930 INFO L85 PathProgramCache]: Analyzing trace with hash -625484592, now seen corresponding path program 1 times [2024-10-14 17:58:07,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:07,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508050667] [2024-10-14 17:58:07,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:07,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:08,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 17:58:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:08,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:08,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508050667] [2024-10-14 17:58:08,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508050667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:58:08,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544930370] [2024-10-14 17:58:08,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:08,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:08,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:58:08,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:58:08,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:58:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:08,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 17:58:08,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:58:08,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:58:08,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 17:58:08,702 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-10-14 17:58:08,702 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 25 treesize of output 28 [2024-10-14 17:58:08,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 17:58:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:08,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:58:08,915 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 40 treesize of output 34 [2024-10-14 17:58:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544930370] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:58:09,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:58:09,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 14 [2024-10-14 17:58:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892397040] [2024-10-14 17:58:09,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:58:09,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 17:58:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:09,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 17:58:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-14 17:58:09,303 INFO L87 Difference]: Start difference. First operand 344 states and 482 transitions. Second operand has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:58:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:10,242 INFO L93 Difference]: Finished difference Result 474 states and 528 transitions. [2024-10-14 17:58:10,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:58:10,242 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-14 17:58:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:10,244 INFO L225 Difference]: With dead ends: 474 [2024-10-14 17:58:10,244 INFO L226 Difference]: Without dead ends: 474 [2024-10-14 17:58:10,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-10-14 17:58:10,245 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 509 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:10,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1194 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 17:58:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-14 17:58:10,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 343. [2024-10-14 17:58:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 212 states have (on average 2.1273584905660377) internal successors, (451), 328 states have internal predecessors, (451), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:58:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 481 transitions. [2024-10-14 17:58:10,251 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 481 transitions. Word has length 31 [2024-10-14 17:58:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:10,251 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 481 transitions. [2024-10-14 17:58:10,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:58:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 481 transitions. [2024-10-14 17:58:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 17:58:10,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:10,252 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:10,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 17:58:10,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:10,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:10,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash -625484591, now seen corresponding path program 1 times [2024-10-14 17:58:10,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:10,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895013677] [2024-10-14 17:58:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:10,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:10,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 17:58:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:11,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895013677] [2024-10-14 17:58:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895013677] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:58:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170941524] [2024-10-14 17:58:11,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:11,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:11,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:58:11,096 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:58:11,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 17:58:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:11,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-14 17:58:11,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:58:11,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:58:11,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:58:11,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-14 17:58:11,265 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 21 treesize of output 20 [2024-10-14 17:58:11,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:58:11,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 17:58:11,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2024-10-14 17:58:11,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2024-10-14 17:58:12,214 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 17:58:12,214 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 25 treesize of output 22 [2024-10-14 17:58:12,235 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 17:58:12,235 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 25 treesize of output 22 [2024-10-14 17:58:12,244 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 13 treesize of output 7 [2024-10-14 17:58:12,264 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 13 treesize of output 7 [2024-10-14 17:58:12,553 INFO L349 Elim1Store]: treesize reduction 68, result has 38.7 percent of original size [2024-10-14 17:58:12,553 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 106 treesize of output 124 [2024-10-14 17:58:12,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:58:12,574 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 87 treesize of output 117 [2024-10-14 17:58:12,967 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 38 treesize of output 22 [2024-10-14 17:58:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:12,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:58:13,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:58:13,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 111 [2024-10-14 17:58:13,453 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 449 treesize of output 427 [2024-10-14 17:58:13,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:58:13,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 250 treesize of output 228 [2024-10-14 17:58:13,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:58:13,470 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 198 treesize of output 203 [2024-10-14 17:58:13,553 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 8 treesize of output 4 [2024-10-14 17:58:13,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_append_~head.base_40 Int) (v_arrayElimArr_3 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#2.base| v_append_~head.base_40 v_arrayElimArr_3) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) (select v_arrayElimArr_3 .cse0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| v_append_~head.base_40 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 0))) (not (= (select v_arrayElimArr_4 .cse0) 0)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse0) 0)) (forall ((v_append_~head.base_40 Int)) (let ((.cse1 (select (store |c_#memory_$Pointer$#2.offset| v_append_~head.base_40 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|))) (or (= (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) (< 0 (+ 6 (select .cse1 .cse0)))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_append_~head.base_40 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$#2.offset| v_append_~head.base_40 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) (< (select .cse2 .cse0) 1)))) (not (= (select v_arrayElimArr_4 .cse0) 0)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_append_~head.base_40 Int)) (or (< (select (select (store |c_#memory_$Pointer$#2.offset| v_append_~head.base_40 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (forall ((v_arrayElimArr_3 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| v_append_~head.base_40 v_arrayElimArr_3) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 0)))) (not (= (select v_arrayElimArr_4 .cse0) 0)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_append_~head.base_40 Int)) (or (< 0 (+ 6 (select (select (store |c_#memory_$Pointer$#2.offset| v_append_~head.base_40 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) (forall ((v_arrayElimArr_3 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| v_append_~head.base_40 v_arrayElimArr_3) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 0)))) (not (= (select v_arrayElimArr_4 .cse0) 0)))) (forall ((v_append_~head.base_40 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_$Pointer$#2.base| v_append_~head.base_40 v_arrayElimArr_3) |c_ULTIMATE.start_main_~list~0#1.base|))) (or (= (select .cse3 .cse0) (select v_arrayElimArr_3 .cse0)) (= (select .cse3 |c_ULTIMATE.start_main_~list~0#1.offset|) 0)))))) is different from false [2024-10-14 17:58:13,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170941524] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:58:13,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:58:13,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2024-10-14 17:58:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105030899] [2024-10-14 17:58:13,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:58:13,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 17:58:13,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 17:58:13,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=675, Unknown=1, NotChecked=52, Total=812 [2024-10-14 17:58:13,597 INFO L87 Difference]: Start difference. First operand 343 states and 481 transitions. Second operand has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:58:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:18,015 INFO L93 Difference]: Finished difference Result 482 states and 535 transitions. [2024-10-14 17:58:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:58:18,016 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (4), 4 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 31 [2024-10-14 17:58:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:18,018 INFO L225 Difference]: With dead ends: 482 [2024-10-14 17:58:18,019 INFO L226 Difference]: Without dead ends: 482 [2024-10-14 17:58:18,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=269, Invalid=1374, Unknown=1, NotChecked=78, Total=1722 [2024-10-14 17:58:18,020 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 785 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:18,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1156 Invalid, 2836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-14 17:58:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-14 17:58:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 343. [2024-10-14 17:58:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 213 states have (on average 2.1173708920187795) internal successors, (451), 328 states have internal predecessors, (451), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:58:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 481 transitions. [2024-10-14 17:58:18,029 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 481 transitions. Word has length 31 [2024-10-14 17:58:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:18,030 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 481 transitions. [2024-10-14 17:58:18,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:58:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 481 transitions. [2024-10-14 17:58:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 17:58:18,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:18,041 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:18,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:58:18,244 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,SelfDestructingSolverStorable9 [2024-10-14 17:58:18,245 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:18,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash 922237530, now seen corresponding path program 1 times [2024-10-14 17:58:18,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:18,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745049831] [2024-10-14 17:58:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:18,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 17:58:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 17:58:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 17:58:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 17:58:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 17:58:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 17:58:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 17:58:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 17:58:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 17:58:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 17:58:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 17:58:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-14 17:58:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 17:58:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-14 17:58:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2024-10-14 17:58:19,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:19,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745049831] [2024-10-14 17:58:19,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745049831] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:58:19,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675534931] [2024-10-14 17:58:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:19,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:19,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:58:19,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:58:19,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 17:58:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 1971 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 17:58:19,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:58:19,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 17:58:20,035 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 10 treesize of output 4 [2024-10-14 17:58:20,049 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 9 treesize of output 3 [2024-10-14 17:58:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 604 proven. 11 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2024-10-14 17:58:20,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:58:20,141 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 10 treesize of output 4 [2024-10-14 17:58:20,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-10-14 17:58:20,234 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 32 treesize of output 26 [2024-10-14 17:58:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 208 proven. 80 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2024-10-14 17:58:20,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675534931] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:58:20,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:58:20,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2024-10-14 17:58:20,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572545193] [2024-10-14 17:58:20,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:58:20,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 17:58:20,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:20,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 17:58:20,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:58:20,302 INFO L87 Difference]: Start difference. First operand 343 states and 481 transitions. Second operand has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-14 17:58:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:20,929 INFO L93 Difference]: Finished difference Result 345 states and 479 transitions. [2024-10-14 17:58:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 17:58:20,929 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 199 [2024-10-14 17:58:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:20,930 INFO L225 Difference]: With dead ends: 345 [2024-10-14 17:58:20,930 INFO L226 Difference]: Without dead ends: 345 [2024-10-14 17:58:20,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 17:58:20,931 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 514 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:20,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 2695 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:58:20,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-14 17:58:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2024-10-14 17:58:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 212 states have (on average 2.1132075471698113) internal successors, (448), 328 states have internal predecessors, (448), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:58:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 478 transitions. [2024-10-14 17:58:20,940 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 478 transitions. Word has length 199 [2024-10-14 17:58:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:20,941 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 478 transitions. [2024-10-14 17:58:20,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-14 17:58:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 478 transitions. [2024-10-14 17:58:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-14 17:58:20,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:20,946 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:20,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 17:58:21,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:21,149 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:21,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash 143444314, now seen corresponding path program 1 times [2024-10-14 17:58:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:21,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451901160] [2024-10-14 17:58:21,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:21,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:28,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 17:58:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 17:58:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:28,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 17:58:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 17:58:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:29,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 17:58:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:29,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 17:58:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 17:58:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:29,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 17:58:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:29,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 17:58:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 17:58:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:29,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 17:58:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:29,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 17:58:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:29,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 17:58:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:29,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 17:58:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 13 proven. 65 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-14 17:58:29,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:29,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451901160] [2024-10-14 17:58:29,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451901160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:58:29,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564102568] [2024-10-14 17:58:29,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:29,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:29,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:58:29,902 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:58:29,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 17:58:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:30,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 2114 conjuncts, 295 conjuncts are in the unsatisfiable core [2024-10-14 17:58:30,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:58:30,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:58:30,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-10-14 17:58:30,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:58:30,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 16 [2024-10-14 17:58:30,795 INFO L349 Elim1Store]: treesize reduction 42, result has 36.4 percent of original size [2024-10-14 17:58:30,796 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 33 treesize of output 41 [2024-10-14 17:58:30,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-10-14 17:58:30,982 INFO L349 Elim1Store]: treesize reduction 106, result has 32.5 percent of original size [2024-10-14 17:58:30,983 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 52 treesize of output 60 [2024-10-14 17:58:30,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:58:30,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 42 [2024-10-14 17:58:31,134 INFO L349 Elim1Store]: treesize reduction 88, result has 30.7 percent of original size [2024-10-14 17:58:31,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 48 [2024-10-14 17:58:31,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 75 treesize of output 35 [2024-10-14 17:58:31,259 INFO L349 Elim1Store]: treesize reduction 72, result has 35.1 percent of original size [2024-10-14 17:58:31,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 59 [2024-10-14 17:58:31,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 75 treesize of output 35 [2024-10-14 17:58:31,533 INFO L349 Elim1Store]: treesize reduction 155, result has 26.2 percent of original size [2024-10-14 17:58:31,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 67 [2024-10-14 17:58:31,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 102 treesize of output 50 [2024-10-14 17:58:31,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:58:31,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 38 [2024-10-14 17:58:31,882 INFO L349 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2024-10-14 17:58:31,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 34 [2024-10-14 17:58:32,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 25 [2024-10-14 17:58:32,177 INFO L349 Elim1Store]: treesize reduction 148, result has 26.7 percent of original size [2024-10-14 17:58:32,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 43 treesize of output 72 [2024-10-14 17:58:32,385 INFO L349 Elim1Store]: treesize reduction 164, result has 33.9 percent of original size [2024-10-14 17:58:32,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 99 [2024-10-14 17:58:32,392 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 67 treesize of output 35 [2024-10-14 17:58:32,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:58:32,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 168 [2024-10-14 17:58:33,309 INFO L349 Elim1Store]: treesize reduction 108, result has 82.1 percent of original size [2024-10-14 17:58:33,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 218 treesize of output 687